./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:51:10,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:51:10,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:51:10,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:51:10,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:51:10,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:51:10,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:51:10,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:51:10,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:51:10,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:51:10,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:51:10,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:51:10,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:51:10,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:51:10,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:51:10,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:51:10,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:51:10,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:51:10,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:51:10,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:51:10,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:51:10,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:51:10,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:51:10,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:51:10,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:51:10,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:51:10,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:51:10,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:51:10,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:51:10,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:51:10,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:51:10,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:51:10,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:51:10,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:51:10,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:51:10,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:51:10,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:51:10,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:51:10,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:51:10,703 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-clean/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-clean/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 -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2024-10-11 14:51:10,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:51:10,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:51:10,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:51:10,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:51:10,951 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:51:10,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2024-10-11 14:51:12,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:51:12,765 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:51:12,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2024-10-11 14:51:12,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32dcf5dfa/68bae11135ed4cf7b44bb755e8ccbdc9/FLAGbf868e404 [2024-10-11 14:51:12,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32dcf5dfa/68bae11135ed4cf7b44bb755e8ccbdc9 [2024-10-11 14:51:12,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:51:12,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:51:12,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:51:12,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:51:12,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:51:12,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:51:12" (1/1) ... [2024-10-11 14:51:12,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1fb20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:12, skipping insertion in model container [2024-10-11 14:51:12,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:51:12" (1/1) ... [2024-10-11 14:51:12,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:51:13,665 WARN L248 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-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2024-10-11 14:51:13,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:51:13,757 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:51:14,007 WARN L248 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-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2024-10-11 14:51:14,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:51:14,077 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:51:14,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14 WrapperNode [2024-10-11 14:51:14,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:51:14,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:51:14,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:51:14,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:51:14,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,213 INFO L138 Inliner]: procedures = 81, calls = 541, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 1907 [2024-10-11 14:51:14,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:51:14,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:51:14,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:51:14,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:51:14,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,348 INFO L175 MemorySlicer]: Split 355 memory accesses to 21 slices as follows [2, 5, 2, 67, 7, 1, 1, 1, 9, 9, 8, 8, 8, 47, 7, 7, 2, 1, 7, 8, 148]. 42 percent of accesses are in the largest equivalence class. The 275 initializations are split as follows [2, 0, 0, 65, 7, 1, 1, 0, 9, 9, 8, 8, 8, 26, 7, 7, 0, 0, 7, 8, 102]. The 12 writes are split as follows [0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 9]. [2024-10-11 14:51:14,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:51:14,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:51:14,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:51:14,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:51:14,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (1/1) ... [2024-10-11 14:51:14,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:51:14,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:51:14,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:51:14,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:51:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:51:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2024-10-11 14:51:14,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2024-10-11 14:51:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:51:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:51:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:51:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:51:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:51:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 14:51:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 14:51:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 14:51:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 14:51:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 14:51:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 14:51:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 14:51:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-11 14:51:14,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2024-10-11 14:51:14,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:51:14,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 14:51:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 14:51:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 14:51:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 14:51:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 14:51:14,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 14:51:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 14:51:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 14:51:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 14:51:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 14:51:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 14:51:14,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-11 14:51:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-11 14:51:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-11 14:51:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-11 14:51:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2024-10-11 14:51:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:51:14,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 14:51:14,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 14:51:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 14:51:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 14:51:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 14:51:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 14:51:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 14:51:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-11 14:51:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-11 14:51:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-11 14:51:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-11 14:51:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-11 14:51:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-11 14:51:14,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2024-10-11 14:51:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2024-10-11 14:51:14,569 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2024-10-11 14:51:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-11 14:51:14,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-11 14:51:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 14:51:14,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 14:51:14,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2024-10-11 14:51:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 14:51:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 14:51:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-11 14:51:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-11 14:51:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-11 14:51:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-11 14:51:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-11 14:51:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-11 14:51:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 14:51:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 14:51:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 14:51:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:51:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:51:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:51:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 14:51:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 14:51:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 14:51:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 14:51:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 14:51:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 14:51:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 14:51:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 14:51:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 14:51:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 14:51:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 14:51:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-11 14:51:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-11 14:51:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-11 14:51:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-11 14:51:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2024-10-11 14:51:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2024-10-11 14:51:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2024-10-11 14:51:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2024-10-11 14:51:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2024-10-11 14:51:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 14:51:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 14:51:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2024-10-11 14:51:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2024-10-11 14:51:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2024-10-11 14:51:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2024-10-11 14:51:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2024-10-11 14:51:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2024-10-11 14:51:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:51:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:51:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:51:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:51:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 14:51:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 14:51:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 14:51:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 14:51:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 14:51:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 14:51:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 14:51:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 14:51:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 14:51:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 14:51:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2024-10-11 14:51:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:51:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:51:14,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:51:14,945 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:51:14,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:51:15,132 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2024-10-11 14:51:15,135 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 14:51:15,172 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2024-10-11 14:51:15,172 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2024-10-11 14:51:15,213 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 14:51:15,216 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 14:51:15,229 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 14:51:16,310 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##324: assume false; [2024-10-11 14:51:16,310 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume !false; [2024-10-11 14:51:16,310 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##73: assume false; [2024-10-11 14:51:16,310 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2024-10-11 14:51:16,311 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2024-10-11 14:51:16,311 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume !false; [2024-10-11 14:51:16,414 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2024-10-11 14:51:16,414 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:51:16,563 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:51:16,564 INFO L314 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-11 14:51:16,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:51:16 BoogieIcfgContainer [2024-10-11 14:51:16,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:51:16,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:51:16,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:51:16,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:51:16,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:51:12" (1/3) ... [2024-10-11 14:51:16,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8677e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:51:16, skipping insertion in model container [2024-10-11 14:51:16,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:14" (2/3) ... [2024-10-11 14:51:16,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8677e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:51:16, skipping insertion in model container [2024-10-11 14:51:16,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:51:16" (3/3) ... [2024-10-11 14:51:16,574 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2024-10-11 14:51:16,591 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:51:16,591 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:51:16,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:51:16,676 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;@68e55e25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:51:16,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:51:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 242 states have (on average 1.6570247933884297) internal successors, (401), 252 states have internal predecessors, (401), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 14:51:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 14:51:16,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:16,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:16,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1744217604, now seen corresponding path program 1 times [2024-10-11 14:51:16,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:16,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237329102] [2024-10-11 14:51:16,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:51:19,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237329102] [2024-10-11 14:51:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237329102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:51:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124637599] [2024-10-11 14:51:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:19,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:51:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:51:19,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:51:19,076 INFO L87 Difference]: Start difference. First operand has 304 states, 242 states have (on average 1.6570247933884297) internal successors, (401), 252 states have internal predecessors, (401), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 14:51:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:20,225 INFO L93 Difference]: Finished difference Result 602 states and 980 transitions. [2024-10-11 14:51:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:51:20,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-11 14:51:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:20,240 INFO L225 Difference]: With dead ends: 602 [2024-10-11 14:51:20,240 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 14:51:20,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:20,247 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 452 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:20,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1004 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:51:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 14:51:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-11 14:51:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 239 states have (on average 1.4435146443514644) internal successors, (345), 246 states have internal predecessors, (345), 45 states have call successors, (45), 14 states have call predecessors, (45), 13 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 14:51:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 432 transitions. [2024-10-11 14:51:20,311 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 432 transitions. Word has length 15 [2024-10-11 14:51:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:20,311 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 432 transitions. [2024-10-11 14:51:20,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 14:51:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 432 transitions. [2024-10-11 14:51:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 14:51:20,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:20,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:20,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:51:20,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:20,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2002383042, now seen corresponding path program 1 times [2024-10-11 14:51:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:20,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648685439] [2024-10-11 14:51:20,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:51:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648685439] [2024-10-11 14:51:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648685439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:51:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751162791] [2024-10-11 14:51:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:21,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:51:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:51:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:51:21,684 INFO L87 Difference]: Start difference. First operand 298 states and 432 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 14:51:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:22,538 INFO L93 Difference]: Finished difference Result 860 states and 1254 transitions. [2024-10-11 14:51:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:51:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2024-10-11 14:51:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:22,543 INFO L225 Difference]: With dead ends: 860 [2024-10-11 14:51:22,543 INFO L226 Difference]: Without dead ends: 577 [2024-10-11 14:51:22,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:51:22,546 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 486 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:22,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 839 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:51:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-11 14:51:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2024-10-11 14:51:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 464 states have (on average 1.4461206896551724) internal successors, (671), 474 states have internal predecessors, (671), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 14:51:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 836 transitions. [2024-10-11 14:51:22,616 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 836 transitions. Word has length 15 [2024-10-11 14:51:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 836 transitions. [2024-10-11 14:51:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 14:51:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 836 transitions. [2024-10-11 14:51:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 14:51:22,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:22,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:51:22,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1944216414, now seen corresponding path program 1 times [2024-10-11 14:51:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247218593] [2024-10-11 14:51:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:51:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247218593] [2024-10-11 14:51:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247218593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:23,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:23,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:51:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688724585] [2024-10-11 14:51:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:23,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:51:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:51:23,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:51:23,914 INFO L87 Difference]: Start difference. First operand 574 states and 836 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-10-11 14:51:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:24,380 INFO L93 Difference]: Finished difference Result 576 states and 837 transitions. [2024-10-11 14:51:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:51:24,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2024-10-11 14:51:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:24,387 INFO L225 Difference]: With dead ends: 576 [2024-10-11 14:51:24,387 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 14:51:24,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:51:24,389 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 440 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:24,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 539 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:51:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 14:51:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-10-11 14:51:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 459 states have (on average 1.4422657952069717) internal successors, (662), 467 states have internal predecessors, (662), 81 states have call successors, (81), 25 states have call predecessors, (81), 24 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-11 14:51:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 822 transitions. [2024-10-11 14:51:24,431 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 822 transitions. Word has length 16 [2024-10-11 14:51:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:24,432 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 822 transitions. [2024-10-11 14:51:24,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-10-11 14:51:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 822 transitions. [2024-10-11 14:51:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 14:51:24,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:24,439 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:51:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:51:24,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1216790774, now seen corresponding path program 1 times [2024-10-11 14:51:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63202670] [2024-10-11 14:51:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:51:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:51:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:25,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63202670] [2024-10-11 14:51:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63202670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:51:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631983076] [2024-10-11 14:51:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:25,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:51:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:25,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:51:25,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:51:25,934 INFO L87 Difference]: Start difference. First operand 565 states and 822 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 14:51:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:26,944 INFO L93 Difference]: Finished difference Result 1103 states and 1609 transitions. [2024-10-11 14:51:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:51:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-10-11 14:51:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:26,950 INFO L225 Difference]: With dead ends: 1103 [2024-10-11 14:51:26,950 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 14:51:26,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:51:26,955 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 127 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:26,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1262 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:51:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 14:51:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2024-10-11 14:51:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 445 states have (on average 1.442696629213483) internal successors, (642), 450 states have internal predecessors, (642), 74 states have call successors, (74), 24 states have call predecessors, (74), 23 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 14:51:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 788 transitions. [2024-10-11 14:51:26,993 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 788 transitions. Word has length 65 [2024-10-11 14:51:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 788 transitions. [2024-10-11 14:51:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 14:51:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 788 transitions. [2024-10-11 14:51:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 14:51:26,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:26,998 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:51:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:51:26,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:26,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:26,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1461730059, now seen corresponding path program 1 times [2024-10-11 14:51:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:26,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191773276] [2024-10-11 14:51:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:51:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:51:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:51:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191773276] [2024-10-11 14:51:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191773276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:28,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:28,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:51:28,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086295762] [2024-10-11 14:51:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:28,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:51:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:28,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:51:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:51:28,808 INFO L87 Difference]: Start difference. First operand 543 states and 788 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 14:51:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:30,385 INFO L93 Difference]: Finished difference Result 842 states and 1222 transitions. [2024-10-11 14:51:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:51:30,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-11 14:51:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:30,391 INFO L225 Difference]: With dead ends: 842 [2024-10-11 14:51:30,391 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 14:51:30,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:51:30,393 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 127 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:30,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 2046 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 14:51:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 14:51:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 555. [2024-10-11 14:51:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 453 states have (on average 1.434878587196468) internal successors, (650), 458 states have internal predecessors, (650), 74 states have call successors, (74), 24 states have call predecessors, (74), 27 states have return successors, (80), 75 states have call predecessors, (80), 72 states have call successors, (80) [2024-10-11 14:51:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 804 transitions. [2024-10-11 14:51:30,426 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 804 transitions. Word has length 61 [2024-10-11 14:51:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:30,426 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 804 transitions. [2024-10-11 14:51:30,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 14:51:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 804 transitions. [2024-10-11 14:51:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 14:51:30,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:30,429 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 14:51:30,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:51:30,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:30,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1206993514, now seen corresponding path program 1 times [2024-10-11 14:51:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483966497] [2024-10-11 14:51:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:51:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:51:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:51:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483966497] [2024-10-11 14:51:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483966497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:32,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:51:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61617481] [2024-10-11 14:51:32,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:32,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:51:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:32,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:51:32,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:51:32,119 INFO L87 Difference]: Start difference. First operand 555 states and 804 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 14:51:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:33,687 INFO L93 Difference]: Finished difference Result 849 states and 1229 transitions. [2024-10-11 14:51:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 14:51:33,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-11 14:51:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:33,694 INFO L225 Difference]: With dead ends: 849 [2024-10-11 14:51:33,694 INFO L226 Difference]: Without dead ends: 560 [2024-10-11 14:51:33,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:33,696 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 142 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:33,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 2532 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 14:51:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-11 14:51:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 555. [2024-10-11 14:51:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 453 states have (on average 1.4326710816777042) internal successors, (649), 458 states have internal predecessors, (649), 74 states have call successors, (74), 24 states have call predecessors, (74), 27 states have return successors, (80), 75 states have call predecessors, (80), 72 states have call successors, (80) [2024-10-11 14:51:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 803 transitions. [2024-10-11 14:51:33,728 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 803 transitions. Word has length 61 [2024-10-11 14:51:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 803 transitions. [2024-10-11 14:51:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 14:51:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 803 transitions. [2024-10-11 14:51:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 14:51:33,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:33,730 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:51:33,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:51:33,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:33,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash -731273453, now seen corresponding path program 1 times [2024-10-11 14:51:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227361128] [2024-10-11 14:51:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:51:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:51:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227361128] [2024-10-11 14:51:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227361128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:35,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:51:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737974509] [2024-10-11 14:51:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:51:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:51:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:51:35,118 INFO L87 Difference]: Start difference. First operand 555 states and 803 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 5 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 14:51:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:36,590 INFO L93 Difference]: Finished difference Result 851 states and 1231 transitions. [2024-10-11 14:51:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:51:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 5 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-10-11 14:51:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:36,595 INFO L225 Difference]: With dead ends: 851 [2024-10-11 14:51:36,595 INFO L226 Difference]: Without dead ends: 848 [2024-10-11 14:51:36,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:51:36,597 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 992 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:36,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 2023 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 14:51:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-10-11 14:51:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 830. [2024-10-11 14:51:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 679 states have (on average 1.4359351988217968) internal successors, (975), 687 states have internal predecessors, (975), 111 states have call successors, (111), 34 states have call predecessors, (111), 39 states have return successors, (123), 113 states have call predecessors, (123), 109 states have call successors, (123) [2024-10-11 14:51:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1209 transitions. [2024-10-11 14:51:36,638 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1209 transitions. Word has length 65 [2024-10-11 14:51:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:36,638 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1209 transitions. [2024-10-11 14:51:36,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 5 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 14:51:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1209 transitions. [2024-10-11 14:51:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 14:51:36,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:36,641 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:51:36,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:51:36,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:36,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash 781143708, now seen corresponding path program 1 times [2024-10-11 14:51:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:36,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993319982] [2024-10-11 14:51:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:51:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:51:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:51:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:51:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993319982] [2024-10-11 14:51:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993319982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:38,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94398422] [2024-10-11 14:51:38,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:38,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:38,039 INFO L87 Difference]: Start difference. First operand 830 states and 1209 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:39,622 INFO L93 Difference]: Finished difference Result 2484 states and 3627 transitions. [2024-10-11 14:51:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:39,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2024-10-11 14:51:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:39,632 INFO L225 Difference]: With dead ends: 2484 [2024-10-11 14:51:39,633 INFO L226 Difference]: Without dead ends: 1671 [2024-10-11 14:51:39,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:39,636 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 741 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:39,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1776 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 14:51:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-11 14:51:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1640. [2024-10-11 14:51:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1345 states have (on average 1.4386617100371748) internal successors, (1935), 1364 states have internal predecessors, (1935), 215 states have call successors, (215), 63 states have call predecessors, (215), 79 states have return successors, (248), 221 states have call predecessors, (248), 213 states have call successors, (248) [2024-10-11 14:51:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2398 transitions. [2024-10-11 14:51:39,729 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2398 transitions. Word has length 79 [2024-10-11 14:51:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:39,729 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2398 transitions. [2024-10-11 14:51:39,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2398 transitions. [2024-10-11 14:51:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 14:51:39,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:39,733 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:51:39,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:51:39,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:39,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2135132568, now seen corresponding path program 1 times [2024-10-11 14:51:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:39,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734111853] [2024-10-11 14:51:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:51:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:51:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:51:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:51:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734111853] [2024-10-11 14:51:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734111853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:51:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494320402] [2024-10-11 14:51:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:51:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:51:41,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:51:41,177 INFO L87 Difference]: Start difference. First operand 1640 states and 2398 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:42,134 INFO L93 Difference]: Finished difference Result 3263 states and 4771 transitions. [2024-10-11 14:51:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:51:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2024-10-11 14:51:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:42,144 INFO L225 Difference]: With dead ends: 3263 [2024-10-11 14:51:42,145 INFO L226 Difference]: Without dead ends: 1634 [2024-10-11 14:51:42,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:51:42,149 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 562 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:42,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1175 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:51:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-11 14:51:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1622. [2024-10-11 14:51:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1336 states have (on average 1.4348802395209581) internal successors, (1917), 1352 states have internal predecessors, (1917), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2365 transitions. [2024-10-11 14:51:42,265 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2365 transitions. Word has length 79 [2024-10-11 14:51:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:42,266 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2365 transitions. [2024-10-11 14:51:42,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2365 transitions. [2024-10-11 14:51:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 14:51:42,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:42,269 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:51:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:51:42,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -404862092, now seen corresponding path program 1 times [2024-10-11 14:51:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17737659] [2024-10-11 14:51:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:51:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:51:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 14:51:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:51:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:51:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:43,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17737659] [2024-10-11 14:51:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17737659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197296680] [2024-10-11 14:51:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:43,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:43,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:43,723 INFO L87 Difference]: Start difference. First operand 1622 states and 2365 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:45,260 INFO L93 Difference]: Finished difference Result 3270 states and 4756 transitions. [2024-10-11 14:51:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:45,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 81 [2024-10-11 14:51:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:45,268 INFO L225 Difference]: With dead ends: 3270 [2024-10-11 14:51:45,268 INFO L226 Difference]: Without dead ends: 1656 [2024-10-11 14:51:45,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:45,272 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 736 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:45,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1760 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 14:51:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-10-11 14:51:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1622. [2024-10-11 14:51:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1336 states have (on average 1.4326347305389222) internal successors, (1914), 1352 states have internal predecessors, (1914), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2362 transitions. [2024-10-11 14:51:45,359 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2362 transitions. Word has length 81 [2024-10-11 14:51:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:45,359 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2362 transitions. [2024-10-11 14:51:45,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2362 transitions. [2024-10-11 14:51:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 14:51:45,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:45,362 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:51:45,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:51:45,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:45,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1132490094, now seen corresponding path program 1 times [2024-10-11 14:51:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948752989] [2024-10-11 14:51:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 14:51:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:51:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:51:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 14:51:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:51:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:46,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:46,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948752989] [2024-10-11 14:51:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948752989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:46,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743670964] [2024-10-11 14:51:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:46,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:46,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:46,655 INFO L87 Difference]: Start difference. First operand 1622 states and 2362 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:48,317 INFO L93 Difference]: Finished difference Result 3267 states and 4747 transitions. [2024-10-11 14:51:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:48,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 82 [2024-10-11 14:51:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:48,326 INFO L225 Difference]: With dead ends: 3267 [2024-10-11 14:51:48,326 INFO L226 Difference]: Without dead ends: 1653 [2024-10-11 14:51:48,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:48,329 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 723 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:48,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1760 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 14:51:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-11 14:51:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1619. [2024-10-11 14:51:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1333 states have (on average 1.431357839459865) internal successors, (1908), 1349 states have internal predecessors, (1908), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2356 transitions. [2024-10-11 14:51:48,423 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2356 transitions. Word has length 82 [2024-10-11 14:51:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:48,425 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2356 transitions. [2024-10-11 14:51:48,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2356 transitions. [2024-10-11 14:51:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 14:51:48,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:48,428 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 14:51:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:51:48,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:48,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash 126058003, now seen corresponding path program 1 times [2024-10-11 14:51:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826889667] [2024-10-11 14:51:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:51:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:51:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:51:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:51:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 14:51:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:49,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826889667] [2024-10-11 14:51:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826889667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:49,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:49,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273867236] [2024-10-11 14:51:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:49,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:49,922 INFO L87 Difference]: Start difference. First operand 1619 states and 2356 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:51,289 INFO L93 Difference]: Finished difference Result 3264 states and 4738 transitions. [2024-10-11 14:51:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 83 [2024-10-11 14:51:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:51,298 INFO L225 Difference]: With dead ends: 3264 [2024-10-11 14:51:51,298 INFO L226 Difference]: Without dead ends: 1653 [2024-10-11 14:51:51,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:51,302 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 720 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:51,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1760 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:51:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-11 14:51:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1619. [2024-10-11 14:51:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1333 states have (on average 1.4291072768192048) internal successors, (1905), 1349 states have internal predecessors, (1905), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2353 transitions. [2024-10-11 14:51:51,384 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2353 transitions. Word has length 83 [2024-10-11 14:51:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:51,385 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2353 transitions. [2024-10-11 14:51:51,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2353 transitions. [2024-10-11 14:51:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 14:51:51,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:51,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:51,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:51:51,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash -988228371, now seen corresponding path program 1 times [2024-10-11 14:51:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955766293] [2024-10-11 14:51:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:51:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:51:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:51:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:51:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 14:51:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955766293] [2024-10-11 14:51:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955766293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:52,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:52,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:52,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481294126] [2024-10-11 14:51:52,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:52,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:52,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:52,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:52,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:52,616 INFO L87 Difference]: Start difference. First operand 1619 states and 2353 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:54,003 INFO L93 Difference]: Finished difference Result 3261 states and 4729 transitions. [2024-10-11 14:51:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:54,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2024-10-11 14:51:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:54,012 INFO L225 Difference]: With dead ends: 3261 [2024-10-11 14:51:54,012 INFO L226 Difference]: Without dead ends: 1650 [2024-10-11 14:51:54,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:54,016 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 707 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:54,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1760 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:51:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-10-11 14:51:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1616. [2024-10-11 14:51:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1330 states have (on average 1.4278195488721805) internal successors, (1899), 1346 states have internal predecessors, (1899), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2347 transitions. [2024-10-11 14:51:54,099 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2347 transitions. Word has length 84 [2024-10-11 14:51:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2347 transitions. [2024-10-11 14:51:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2347 transitions. [2024-10-11 14:51:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 14:51:54,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:54,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:54,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:51:54,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:54,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash 963167282, now seen corresponding path program 1 times [2024-10-11 14:51:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:54,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176477920] [2024-10-11 14:51:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:51:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:51:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:51:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:51:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 14:51:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176477920] [2024-10-11 14:51:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176477920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:55,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:55,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156662763] [2024-10-11 14:51:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:55,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:55,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:55,538 INFO L87 Difference]: Start difference. First operand 1616 states and 2347 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:56,834 INFO L93 Difference]: Finished difference Result 3252 states and 4714 transitions. [2024-10-11 14:51:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2024-10-11 14:51:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:56,842 INFO L225 Difference]: With dead ends: 3252 [2024-10-11 14:51:56,842 INFO L226 Difference]: Without dead ends: 1647 [2024-10-11 14:51:56,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:56,846 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 697 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:56,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1760 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 14:51:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-11 14:51:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1616. [2024-10-11 14:51:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1330 states have (on average 1.4255639097744361) internal successors, (1896), 1346 states have internal predecessors, (1896), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2344 transitions. [2024-10-11 14:51:56,930 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2344 transitions. Word has length 84 [2024-10-11 14:51:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:56,930 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2344 transitions. [2024-10-11 14:51:56,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2344 transitions. [2024-10-11 14:51:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 14:51:56,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:56,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:56,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:51:56,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:56,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash 188322226, now seen corresponding path program 1 times [2024-10-11 14:51:56,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:56,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911197944] [2024-10-11 14:51:56,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:51:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 14:51:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:51:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:51:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:51:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:51:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:51:58,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911197944] [2024-10-11 14:51:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911197944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:58,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465780701] [2024-10-11 14:51:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:58,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:58,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:58,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:58,241 INFO L87 Difference]: Start difference. First operand 1616 states and 2344 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:59,519 INFO L93 Difference]: Finished difference Result 3252 states and 4708 transitions. [2024-10-11 14:51:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:51:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 85 [2024-10-11 14:51:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:59,530 INFO L225 Difference]: With dead ends: 3252 [2024-10-11 14:51:59,531 INFO L226 Difference]: Without dead ends: 1647 [2024-10-11 14:51:59,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:51:59,536 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 691 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:59,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1760 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 14:51:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-11 14:51:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1616. [2024-10-11 14:51:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1330 states have (on average 1.4233082706766917) internal successors, (1893), 1346 states have internal predecessors, (1893), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:51:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2341 transitions. [2024-10-11 14:51:59,626 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2341 transitions. Word has length 85 [2024-10-11 14:51:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:59,627 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2341 transitions. [2024-10-11 14:51:59,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:51:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2341 transitions. [2024-10-11 14:51:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 14:51:59,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:59,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:59,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:51:59,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1366560811, now seen corresponding path program 1 times [2024-10-11 14:51:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:59,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406820534] [2024-10-11 14:51:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:52:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 14:52:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 14:52:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 14:52:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 14:52:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 14:52:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:52:00,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:00,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406820534] [2024-10-11 14:52:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406820534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:00,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:00,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:52:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665220372] [2024-10-11 14:52:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:52:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:52:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:52:00,936 INFO L87 Difference]: Start difference. First operand 1616 states and 2341 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:52:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:02,281 INFO L93 Difference]: Finished difference Result 3252 states and 4702 transitions. [2024-10-11 14:52:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:52:02,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 86 [2024-10-11 14:52:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:02,290 INFO L225 Difference]: With dead ends: 3252 [2024-10-11 14:52:02,290 INFO L226 Difference]: Without dead ends: 1647 [2024-10-11 14:52:02,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:52:02,294 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 685 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:02,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1760 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:52:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-11 14:52:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1616. [2024-10-11 14:52:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1330 states have (on average 1.4210526315789473) internal successors, (1890), 1346 states have internal predecessors, (1890), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:52:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2338 transitions. [2024-10-11 14:52:02,375 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2338 transitions. Word has length 86 [2024-10-11 14:52:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:02,376 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2338 transitions. [2024-10-11 14:52:02,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:52:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2338 transitions. [2024-10-11 14:52:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 14:52:02,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:02,378 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:02,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:52:02,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1574064713, now seen corresponding path program 1 times [2024-10-11 14:52:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571049696] [2024-10-11 14:52:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:02,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:52:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:52:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:52:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:52:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:52:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:52:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:52:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571049696] [2024-10-11 14:52:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571049696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:52:03,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991672799] [2024-10-11 14:52:03,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:03,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:52:03,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:52:03,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:52:03,687 INFO L87 Difference]: Start difference. First operand 1616 states and 2338 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:52:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:05,120 INFO L93 Difference]: Finished difference Result 3252 states and 4696 transitions. [2024-10-11 14:52:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:52:05,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 87 [2024-10-11 14:52:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:05,130 INFO L225 Difference]: With dead ends: 3252 [2024-10-11 14:52:05,130 INFO L226 Difference]: Without dead ends: 1647 [2024-10-11 14:52:05,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:52:05,134 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 684 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:05,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1760 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:52:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-11 14:52:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1616. [2024-10-11 14:52:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1330 states have (on average 1.418796992481203) internal successors, (1887), 1346 states have internal predecessors, (1887), 209 states have call successors, (209), 63 states have call predecessors, (209), 76 states have return successors, (239), 215 states have call predecessors, (239), 207 states have call successors, (239) [2024-10-11 14:52:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2335 transitions. [2024-10-11 14:52:05,218 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2335 transitions. Word has length 87 [2024-10-11 14:52:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:05,219 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2335 transitions. [2024-10-11 14:52:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 14:52:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2335 transitions. [2024-10-11 14:52:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 14:52:05,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:05,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:05,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:52:05,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1334117173, now seen corresponding path program 1 times [2024-10-11 14:52:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497576049] [2024-10-11 14:52:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:52:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:52:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:52:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:52:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:52:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:52:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:52:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497576049] [2024-10-11 14:52:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497576049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:52:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71767216] [2024-10-11 14:52:06,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:06,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:52:06,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:52:06,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:52:06,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:52:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:08,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 14:52:08,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:52:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:52:08,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:52:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:52:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71767216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:52:08,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:52:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2024-10-11 14:52:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285148998] [2024-10-11 14:52:08,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:52:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 14:52:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:08,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 14:52:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:52:08,933 INFO L87 Difference]: Start difference. First operand 1616 states and 2335 transitions. Second operand has 23 states, 21 states have (on average 4.285714285714286) internal successors, (90), 16 states have internal predecessors, (90), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-11 14:52:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:11,498 INFO L93 Difference]: Finished difference Result 2769 states and 3985 transitions. [2024-10-11 14:52:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 14:52:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.285714285714286) internal successors, (90), 16 states have internal predecessors, (90), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) Word has length 87 [2024-10-11 14:52:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:11,506 INFO L225 Difference]: With dead ends: 2769 [2024-10-11 14:52:11,506 INFO L226 Difference]: Without dead ends: 1170 [2024-10-11 14:52:11,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 14:52:11,509 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 210 mSDsluCounter, 4936 mSDsCounter, 0 mSdLazyCounter, 3418 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 5228 SdHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 3418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:11,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 5228 Invalid, 3573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 3418 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 14:52:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-10-11 14:52:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1152. [2024-10-11 14:52:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 938 states have (on average 1.4008528784648189) internal successors, (1314), 950 states have internal predecessors, (1314), 153 states have call successors, (153), 55 states have call predecessors, (153), 60 states have return successors, (167), 153 states have call predecessors, (167), 151 states have call successors, (167) [2024-10-11 14:52:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1634 transitions. [2024-10-11 14:52:11,574 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1634 transitions. Word has length 87 [2024-10-11 14:52:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:11,575 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1634 transitions. [2024-10-11 14:52:11,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.285714285714286) internal successors, (90), 16 states have internal predecessors, (90), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2024-10-11 14:52:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1634 transitions. [2024-10-11 14:52:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 14:52:11,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:11,579 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:11,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:52:11,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 14:52:11,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:11,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash -967349264, now seen corresponding path program 1 times [2024-10-11 14:52:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239629600] [2024-10-11 14:52:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 14:52:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:52:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:52:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:52:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:52:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 14:52:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:52:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239629600] [2024-10-11 14:52:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239629600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:52:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469705944] [2024-10-11 14:52:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:52:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:52:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:52:13,076 INFO L87 Difference]: Start difference. First operand 1152 states and 1634 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 14:52:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:14,185 INFO L93 Difference]: Finished difference Result 2307 states and 3270 transitions. [2024-10-11 14:52:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:52:14,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-10-11 14:52:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:14,191 INFO L225 Difference]: With dead ends: 2307 [2024-10-11 14:52:14,192 INFO L226 Difference]: Without dead ends: 1164 [2024-10-11 14:52:14,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:52:14,194 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 191 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:14,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1994 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:52:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2024-10-11 14:52:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1148. [2024-10-11 14:52:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 936 states have (on average 1.3995726495726495) internal successors, (1310), 947 states have internal predecessors, (1310), 152 states have call successors, (152), 54 states have call predecessors, (152), 59 states have return successors, (166), 152 states have call predecessors, (166), 150 states have call successors, (166) [2024-10-11 14:52:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1628 transitions. [2024-10-11 14:52:14,256 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1628 transitions. Word has length 89 [2024-10-11 14:52:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:14,257 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1628 transitions. [2024-10-11 14:52:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 14:52:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1628 transitions. [2024-10-11 14:52:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 14:52:14,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:14,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:14,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 14:52:14,259 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:14,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1895959639, now seen corresponding path program 1 times [2024-10-11 14:52:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:14,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049381037] [2024-10-11 14:52:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:52:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:52:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:52:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 14:52:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:52:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 14:52:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 14:52:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:52:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049381037] [2024-10-11 14:52:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049381037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:52:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82234072] [2024-10-11 14:52:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:52:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:15,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:52:15,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:52:15,754 INFO L87 Difference]: Start difference. First operand 1148 states and 1628 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 7 states have internal predecessors, (67), 5 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 14:52:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:16,814 INFO L93 Difference]: Finished difference Result 1208 states and 1686 transitions. [2024-10-11 14:52:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:52:16,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 7 states have internal predecessors, (67), 5 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2024-10-11 14:52:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:16,817 INFO L225 Difference]: With dead ends: 1208 [2024-10-11 14:52:16,817 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 14:52:16,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:52:16,820 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 580 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:16,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1385 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:52:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 14:52:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 14:52:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:52:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 14:52:16,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-10-11 14:52:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:16,832 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 14:52:16,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 7 states have internal predecessors, (67), 5 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 14:52:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 14:52:16,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 14:52:16,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:52:16,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 14:52:16,841 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:16,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.