./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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 13:39:59,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 13:39:59,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 13:39:59,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 13:39:59,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 13:39:59,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 13:39:59,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 13:39:59,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 13:39:59,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 13:39:59,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 13:39:59,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 13:39:59,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 13:39:59,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 13:39:59,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 13:39:59,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 13:39:59,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 13:39:59,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 13:39:59,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 13:39:59,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 13:39:59,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 13:39:59,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 13:39:59,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 13:39:59,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 13:39:59,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 13:39:59,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 13:39:59,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 13:39:59,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 13:39:59,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 13:39:59,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 13:39:59,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:39:59,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 13:39:59,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 13:39:59,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 13:39:59,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 13:39:59,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 13:39:59,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 13:39:59,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 13:39:59,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 13:39:59,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 13:39:59,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 [2024-10-24 13:39:59,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 13:39:59,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 13:39:59,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 13:39:59,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 13:39:59,729 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 13:39:59,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2024-10-24 13:40:01,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 13:40:01,643 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 13:40:01,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2024-10-24 13:40:01,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced7e9182/042da110800a486e944917c8840145e1/FLAG9676abb26 [2024-10-24 13:40:02,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced7e9182/042da110800a486e944917c8840145e1 [2024-10-24 13:40:02,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 13:40:02,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 13:40:02,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 13:40:02,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 13:40:02,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 13:40:02,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:40:02" (1/1) ... [2024-10-24 13:40:02,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465d0fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:02, skipping insertion in model container [2024-10-24 13:40:02,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:40:02" (1/1) ... [2024-10-24 13:40:02,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 13:40:03,027 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2024-10-24 13:40:03,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:40:03,427 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 13:40:03,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2024-10-24 13:40:03,575 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5440] [2024-10-24 13:40:03,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5447] [2024-10-24 13:40:03,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5455-5456] [2024-10-24 13:40:03,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [5484] [2024-10-24 13:40:03,578 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0": "+m" (v->counter)); [5491] [2024-10-24 13:40:03,585 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2024-10-24 13:40:03,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6228/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/usb_8dev.o.c.prepared"), "i" (621), "i" (12UL)); [6324-6325] [2024-10-24 13:40:03,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:40:03,794 INFO L204 MainTranslator]: Completed translation [2024-10-24 13:40:03,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03 WrapperNode [2024-10-24 13:40:03,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 13:40:03,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 13:40:03,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 13:40:03,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 13:40:03,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:03,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:03,942 INFO L138 Inliner]: procedures = 175, calls = 824, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2645 [2024-10-24 13:40:03,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 13:40:03,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 13:40:03,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 13:40:03,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 13:40:03,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:03,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:03,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,216 INFO L175 MemorySlicer]: Split 455 memory accesses to 8 slices as follows [2, 1, 31, 31, 42, 5, 334, 9]. 73 percent of accesses are in the largest equivalence class. The 124 initializations are split as follows [2, 0, 0, 0, 42, 0, 80, 0]. The 144 writes are split as follows [0, 0, 18, 0, 0, 1, 125, 0]. [2024-10-24 13:40:04,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 13:40:04,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 13:40:04,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 13:40:04,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 13:40:04,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (1/1) ... [2024-10-24 13:40:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:40:04,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:40:04,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 13:40:04,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 13:40:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-24 13:40:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-24 13:40:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2024-10-24 13:40:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2024-10-24 13:40:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2024-10-24 13:40:04,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2024-10-24 13:40:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2024-10-24 13:40:04,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2024-10-24 13:40:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-24 13:40:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-24 13:40:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2024-10-24 13:40:04,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-24 13:40:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2024-10-24 13:40:04,563 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 13:40:04,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-24 13:40:04,563 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-24 13:40:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2024-10-24 13:40:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2024-10-24 13:40:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2024-10-24 13:40:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2024-10-24 13:40:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-24 13:40:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-24 13:40:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-24 13:40:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-24 13:40:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-24 13:40:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-24 13:40:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-24 13:40:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-24 13:40:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-24 13:40:04,568 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-24 13:40:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-24 13:40:04,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-24 13:40:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 13:40:04,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 13:40:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2024-10-24 13:40:04,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2024-10-24 13:40:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2024-10-24 13:40:04,569 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-24 13:40:04,570 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-24 13:40:04,570 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 13:40:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-24 13:40:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-24 13:40:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 13:40:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-24 13:40:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-24 13:40:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-24 13:40:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-24 13:40:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-24 13:40:04,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 13:40:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-24 13:40:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2024-10-24 13:40:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2024-10-24 13:40:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-10-24 13:40:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-24 13:40:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 13:40:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 13:40:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-24 13:40:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-24 13:40:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 13:40:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 13:40:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 13:40:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 13:40:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 13:40:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-24 13:40:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-24 13:40:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2024-10-24 13:40:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2024-10-24 13:40:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-24 13:40:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-24 13:40:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2024-10-24 13:40:04,578 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2024-10-24 13:40:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 13:40:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 13:40:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 13:40:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 13:40:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 13:40:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 13:40:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 13:40:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 13:40:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 13:40:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2024-10-24 13:40:04,581 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2024-10-24 13:40:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-24 13:40:04,582 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 13:40:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-24 13:40:04,583 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-10-24 13:40:04,583 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2024-10-24 13:40:04,583 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2024-10-24 13:40:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-24 13:40:04,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-24 13:40:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 13:40:04,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 13:40:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2024-10-24 13:40:04,584 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2024-10-24 13:40:04,972 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 13:40:04,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 13:40:05,069 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 13:40:05,705 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2024-10-24 13:40:08,060 INFO L? ?]: Removed 1214 outVars from TransFormulas that were not future-live. [2024-10-24 13:40:08,060 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 13:40:08,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 13:40:08,204 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 13:40:08,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:40:08 BoogieIcfgContainer [2024-10-24 13:40:08,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 13:40:08,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 13:40:08,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 13:40:08,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 13:40:08,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:40:02" (1/3) ... [2024-10-24 13:40:08,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807e8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:40:08, skipping insertion in model container [2024-10-24 13:40:08,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:40:03" (2/3) ... [2024-10-24 13:40:08,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807e8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:40:08, skipping insertion in model container [2024-10-24 13:40:08,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:40:08" (3/3) ... [2024-10-24 13:40:08,213 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2024-10-24 13:40:08,226 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 13:40:08,226 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 13:40:08,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 13:40:08,315 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;@32f5d7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 13:40:08,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 13:40:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 494 states have (on average 1.4271255060728745) internal successors, (705), 514 states have internal predecessors, (705), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-24 13:40:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 13:40:08,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:08,335 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] [2024-10-24 13:40:08,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2119933231, now seen corresponding path program 1 times [2024-10-24 13:40:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143564226] [2024-10-24 13:40:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:08,940 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-24 13:40:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143564226] [2024-10-24 13:40:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143564226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:40:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890272938] [2024-10-24 13:40:08,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:40:08,968 INFO L87 Difference]: Start difference. First operand has 696 states, 494 states have (on average 1.4271255060728745) internal successors, (705), 514 states have internal predecessors, (705), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 13:40:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:12,175 INFO L93 Difference]: Finished difference Result 2167 states and 3239 transitions. [2024-10-24 13:40:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 13:40:12,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-24 13:40:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:12,196 INFO L225 Difference]: With dead ends: 2167 [2024-10-24 13:40:12,196 INFO L226 Difference]: Without dead ends: 1453 [2024-10-24 13:40:12,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-24 13:40:12,212 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1180 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:12,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1894 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 13:40:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-10-24 13:40:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1345. [2024-10-24 13:40:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 967 states have (on average 1.3619441571871769) internal successors, (1317), 987 states have internal predecessors, (1317), 289 states have call successors, (289), 89 states have call predecessors, (289), 88 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2024-10-24 13:40:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1890 transitions. [2024-10-24 13:40:12,381 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1890 transitions. Word has length 23 [2024-10-24 13:40:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:12,382 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1890 transitions. [2024-10-24 13:40:12,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 13:40:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1890 transitions. [2024-10-24 13:40:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 13:40:12,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:12,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-24 13:40:12,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 13:40:12,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:12,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1009435931, now seen corresponding path program 1 times [2024-10-24 13:40:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506546728] [2024-10-24 13:40:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:40:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506546728] [2024-10-24 13:40:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506546728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:12,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:40:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791244212] [2024-10-24 13:40:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:12,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:40:12,724 INFO L87 Difference]: Start difference. First operand 1345 states and 1890 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:15,594 INFO L93 Difference]: Finished difference Result 4240 states and 6073 transitions. [2024-10-24 13:40:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 13:40:15,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-24 13:40:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:15,609 INFO L225 Difference]: With dead ends: 4240 [2024-10-24 13:40:15,609 INFO L226 Difference]: Without dead ends: 2900 [2024-10-24 13:40:15,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 13:40:15,615 INFO L432 NwaCegarLoop]: 1135 mSDtfsCounter, 1088 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:15,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 2402 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 13:40:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2024-10-24 13:40:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2674. [2024-10-24 13:40:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 1926 states have (on average 1.3603322949117342) internal successors, (2620), 1962 states have internal predecessors, (2620), 571 states have call successors, (571), 177 states have call predecessors, (571), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-24 13:40:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3771 transitions. [2024-10-24 13:40:15,715 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3771 transitions. Word has length 32 [2024-10-24 13:40:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:15,715 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 3771 transitions. [2024-10-24 13:40:15,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3771 transitions. [2024-10-24 13:40:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 13:40:15,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:15,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-24 13:40:15,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 13:40:15,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1228159411, now seen corresponding path program 1 times [2024-10-24 13:40:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056609099] [2024-10-24 13:40:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:15,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:15,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:15,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:40:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056609099] [2024-10-24 13:40:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056609099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:15,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:15,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:40:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516348903] [2024-10-24 13:40:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:15,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:40:16,001 INFO L87 Difference]: Start difference. First operand 2674 states and 3771 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:18,739 INFO L93 Difference]: Finished difference Result 2892 states and 4166 transitions. [2024-10-24 13:40:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:40:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-24 13:40:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:18,753 INFO L225 Difference]: With dead ends: 2892 [2024-10-24 13:40:18,754 INFO L226 Difference]: Without dead ends: 2889 [2024-10-24 13:40:18,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 13:40:18,757 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1014 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:18,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1191 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 13:40:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2024-10-24 13:40:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2673. [2024-10-24 13:40:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 1926 states have (on average 1.3598130841121496) internal successors, (2619), 1961 states have internal predecessors, (2619), 570 states have call successors, (570), 177 states have call predecessors, (570), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-24 13:40:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3769 transitions. [2024-10-24 13:40:18,856 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3769 transitions. Word has length 33 [2024-10-24 13:40:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:18,857 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 3769 transitions. [2024-10-24 13:40:18,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3769 transitions. [2024-10-24 13:40:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 13:40:18,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:18,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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-24 13:40:18,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 13:40:18,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 581352168, now seen corresponding path program 1 times [2024-10-24 13:40:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217668560] [2024-10-24 13:40:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:40:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:19,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217668560] [2024-10-24 13:40:19,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217668560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:19,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:19,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:40:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262346007] [2024-10-24 13:40:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:19,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:40:19,114 INFO L87 Difference]: Start difference. First operand 2673 states and 3769 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:21,321 INFO L93 Difference]: Finished difference Result 2891 states and 4164 transitions. [2024-10-24 13:40:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:40:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-10-24 13:40:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:21,338 INFO L225 Difference]: With dead ends: 2891 [2024-10-24 13:40:21,338 INFO L226 Difference]: Without dead ends: 2888 [2024-10-24 13:40:21,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 13:40:21,340 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1012 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:21,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1185 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 13:40:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-24 13:40:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2672. [2024-10-24 13:40:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 1926 states have (on average 1.3592938733125648) internal successors, (2618), 1960 states have internal predecessors, (2618), 569 states have call successors, (569), 177 states have call predecessors, (569), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-24 13:40:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3767 transitions. [2024-10-24 13:40:21,453 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 3767 transitions. Word has length 34 [2024-10-24 13:40:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:21,453 INFO L471 AbstractCegarLoop]: Abstraction has 2672 states and 3767 transitions. [2024-10-24 13:40:21,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3767 transitions. [2024-10-24 13:40:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 13:40:21,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:21,455 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 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-24 13:40:21,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 13:40:21,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:21,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 841641136, now seen corresponding path program 1 times [2024-10-24 13:40:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286933567] [2024-10-24 13:40:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:40:21,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:21,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286933567] [2024-10-24 13:40:21,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286933567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:21,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:21,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:40:21,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394182706] [2024-10-24 13:40:21,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:21,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:21,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:21,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:40:21,654 INFO L87 Difference]: Start difference. First operand 2672 states and 3767 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:23,744 INFO L93 Difference]: Finished difference Result 2890 states and 4162 transitions. [2024-10-24 13:40:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:40:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-24 13:40:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:23,762 INFO L225 Difference]: With dead ends: 2890 [2024-10-24 13:40:23,762 INFO L226 Difference]: Without dead ends: 2887 [2024-10-24 13:40:23,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 13:40:23,764 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 1015 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:23,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1175 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 13:40:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2024-10-24 13:40:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2671. [2024-10-24 13:40:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 1926 states have (on average 1.3587746625129802) internal successors, (2617), 1959 states have internal predecessors, (2617), 568 states have call successors, (568), 177 states have call predecessors, (568), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-24 13:40:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3765 transitions. [2024-10-24 13:40:23,901 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3765 transitions. Word has length 35 [2024-10-24 13:40:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:23,901 INFO L471 AbstractCegarLoop]: Abstraction has 2671 states and 3765 transitions. [2024-10-24 13:40:23,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3765 transitions. [2024-10-24 13:40:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 13:40:23,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:23,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 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-24 13:40:23,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 13:40:23,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash 320669419, now seen corresponding path program 1 times [2024-10-24 13:40:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:23,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080973207] [2024-10-24 13:40:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:24,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:24,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:40:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080973207] [2024-10-24 13:40:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080973207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:40:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662610281] [2024-10-24 13:40:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:24,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:40:24,110 INFO L87 Difference]: Start difference. First operand 2671 states and 3765 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:26,034 INFO L93 Difference]: Finished difference Result 2889 states and 4160 transitions. [2024-10-24 13:40:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:40:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-24 13:40:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:26,043 INFO L225 Difference]: With dead ends: 2889 [2024-10-24 13:40:26,044 INFO L226 Difference]: Without dead ends: 2880 [2024-10-24 13:40:26,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 13:40:26,045 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 1012 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:26,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1173 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 13:40:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2024-10-24 13:40:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2664. [2024-10-24 13:40:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 1920 states have (on average 1.3578125) internal successors, (2607), 1952 states have internal predecessors, (2607), 567 states have call successors, (567), 177 states have call predecessors, (567), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-24 13:40:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3754 transitions. [2024-10-24 13:40:26,157 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3754 transitions. Word has length 36 [2024-10-24 13:40:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 3754 transitions. [2024-10-24 13:40:26,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:40:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3754 transitions. [2024-10-24 13:40:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 13:40:26,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:26,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-24 13:40:26,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 13:40:26,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:26,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1640778586, now seen corresponding path program 1 times [2024-10-24 13:40:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706083661] [2024-10-24 13:40:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 13:40:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:40:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 13:40:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 13:40:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:40:26,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:26,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706083661] [2024-10-24 13:40:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706083661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:26,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:26,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:40:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128257820] [2024-10-24 13:40:26,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:26,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:40:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:40:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:40:26,346 INFO L87 Difference]: Start difference. First operand 2664 states and 3754 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 13:40:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:28,763 INFO L93 Difference]: Finished difference Result 6372 states and 9039 transitions. [2024-10-24 13:40:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 13:40:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-10-24 13:40:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:28,781 INFO L225 Difference]: With dead ends: 6372 [2024-10-24 13:40:28,781 INFO L226 Difference]: Without dead ends: 3713 [2024-10-24 13:40:28,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 13:40:28,790 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 828 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:28,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1792 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 13:40:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2024-10-24 13:40:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3400. [2024-10-24 13:40:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 2428 states have (on average 1.3500823723228994) internal successors, (3278), 2472 states have internal predecessors, (3278), 714 states have call successors, (714), 252 states have call predecessors, (714), 257 states have return successors, (745), 711 states have call predecessors, (745), 713 states have call successors, (745) [2024-10-24 13:40:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4737 transitions. [2024-10-24 13:40:29,134 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4737 transitions. Word has length 74 [2024-10-24 13:40:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:29,135 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 4737 transitions. [2024-10-24 13:40:29,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 13:40:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4737 transitions. [2024-10-24 13:40:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 13:40:29,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:29,144 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2024-10-24 13:40:29,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 13:40:29,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:29,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1925789135, now seen corresponding path program 1 times [2024-10-24 13:40:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:29,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318975612] [2024-10-24 13:40:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:40:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 13:40:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 13:40:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 13:40:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 13:40:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318975612] [2024-10-24 13:40:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318975612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:40:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176858423] [2024-10-24 13:40:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:29,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:40:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:40:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:40:29,780 INFO L87 Difference]: Start difference. First operand 3400 states and 4737 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 13:40:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:36,177 INFO L93 Difference]: Finished difference Result 7890 states and 11099 transitions. [2024-10-24 13:40:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 13:40:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2024-10-24 13:40:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:36,194 INFO L225 Difference]: With dead ends: 7890 [2024-10-24 13:40:36,194 INFO L226 Difference]: Without dead ends: 4501 [2024-10-24 13:40:36,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 13:40:36,201 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 569 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:36,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 2739 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-24 13:40:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2024-10-24 13:40:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4156. [2024-10-24 13:40:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 2966 states have (on average 1.3465947403910992) internal successors, (3994), 3018 states have internal predecessors, (3994), 858 states have call successors, (858), 326 states have call predecessors, (858), 331 states have return successors, (889), 855 states have call predecessors, (889), 857 states have call successors, (889) [2024-10-24 13:40:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 5741 transitions. [2024-10-24 13:40:36,385 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 5741 transitions. Word has length 86 [2024-10-24 13:40:36,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:36,386 INFO L471 AbstractCegarLoop]: Abstraction has 4156 states and 5741 transitions. [2024-10-24 13:40:36,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 13:40:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 5741 transitions. [2024-10-24 13:40:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 13:40:36,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:36,392 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:40:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 13:40:36,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2113625808, now seen corresponding path program 1 times [2024-10-24 13:40:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352141318] [2024-10-24 13:40:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:40:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 13:40:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 13:40:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 13:40:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 13:40:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352141318] [2024-10-24 13:40:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352141318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:40:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718144405] [2024-10-24 13:40:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:40:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:40:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:40:36,569 INFO L87 Difference]: Start difference. First operand 4156 states and 5741 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 13:40:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:43,679 INFO L93 Difference]: Finished difference Result 10666 states and 14849 transitions. [2024-10-24 13:40:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 13:40:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-10-24 13:40:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:43,743 INFO L225 Difference]: With dead ends: 10666 [2024-10-24 13:40:43,743 INFO L226 Difference]: Without dead ends: 6521 [2024-10-24 13:40:43,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:40:43,755 INFO L432 NwaCegarLoop]: 843 mSDtfsCounter, 1282 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:43,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2683 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-24 13:40:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6521 states. [2024-10-24 13:40:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6521 to 5906. [2024-10-24 13:40:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5906 states, 4262 states have (on average 1.348193336461755) internal successors, (5746), 4342 states have internal predecessors, (5746), 1140 states have call successors, (1140), 492 states have call predecessors, (1140), 503 states have return successors, (1185), 1135 states have call predecessors, (1185), 1139 states have call successors, (1185) [2024-10-24 13:40:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5906 states to 5906 states and 8071 transitions. [2024-10-24 13:40:44,089 INFO L78 Accepts]: Start accepts. Automaton has 5906 states and 8071 transitions. Word has length 97 [2024-10-24 13:40:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 5906 states and 8071 transitions. [2024-10-24 13:40:44,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 13:40:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5906 states and 8071 transitions. [2024-10-24 13:40:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 13:40:44,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:44,101 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:40:44,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 13:40:44,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:44,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2062913462, now seen corresponding path program 1 times [2024-10-24 13:40:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486559944] [2024-10-24 13:40:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:40:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 13:40:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:40:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 13:40:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 13:40:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 13:40:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 13:40:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:40:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 13:40:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486559944] [2024-10-24 13:40:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486559944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:40:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971389408] [2024-10-24 13:40:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:44,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:40:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:40:44,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 13:40:44,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 13:40:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:44,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 13:40:44,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:40:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 13:40:45,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 13:40:45,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971389408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:45,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 13:40:45,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-10-24 13:40:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104696775] [2024-10-24 13:40:45,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:45,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:40:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:45,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:40:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:40:45,155 INFO L87 Difference]: Start difference. First operand 5906 states and 8071 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 13:40:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:47,322 INFO L93 Difference]: Finished difference Result 17701 states and 24189 transitions. [2024-10-24 13:40:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:40:47,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-10-24 13:40:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:47,387 INFO L225 Difference]: With dead ends: 17701 [2024-10-24 13:40:47,387 INFO L226 Difference]: Without dead ends: 17696 [2024-10-24 13:40:47,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:40:47,398 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 2287 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:47,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 2430 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 13:40:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17696 states. [2024-10-24 13:40:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17696 to 17666. [2024-10-24 13:40:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17666 states, 12746 states have (on average 1.3488153146085047) internal successors, (17192), 13002 states have internal predecessors, (17192), 3412 states have call successors, (3412), 1472 states have call predecessors, (3412), 1507 states have return successors, (3549), 3383 states have call predecessors, (3549), 3411 states have call successors, (3549) [2024-10-24 13:40:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17666 states to 17666 states and 24153 transitions. [2024-10-24 13:40:48,341 INFO L78 Accepts]: Start accepts. Automaton has 17666 states and 24153 transitions. Word has length 112 [2024-10-24 13:40:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:48,342 INFO L471 AbstractCegarLoop]: Abstraction has 17666 states and 24153 transitions. [2024-10-24 13:40:48,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 13:40:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17666 states and 24153 transitions. [2024-10-24 13:40:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 13:40:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:48,358 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:40:48,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 13:40:48,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 13:40:48,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1394428374, now seen corresponding path program 1 times [2024-10-24 13:40:48,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:48,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321385092] [2024-10-24 13:40:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:40:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 13:40:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:40:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 13:40:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 13:40:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 13:40:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 13:40:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:40:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 13:40:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-24 13:40:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321385092] [2024-10-24 13:40:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321385092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:48,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:40:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55254000] [2024-10-24 13:40:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:40:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:40:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:40:48,831 INFO L87 Difference]: Start difference. First operand 17666 states and 24153 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 13:40:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:40:56,321 INFO L93 Difference]: Finished difference Result 27842 states and 38365 transitions. [2024-10-24 13:40:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 13:40:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-10-24 13:40:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:40:56,365 INFO L225 Difference]: With dead ends: 27842 [2024-10-24 13:40:56,366 INFO L226 Difference]: Without dead ends: 9651 [2024-10-24 13:40:56,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:40:56,403 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 1178 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-24 13:40:56,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 2213 Invalid, 1954 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [472 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-24 13:40:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9651 states. [2024-10-24 13:40:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9651 to 8755. [2024-10-24 13:40:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8755 states, 6318 states have (on average 1.3442545109211776) internal successors, (8493), 6446 states have internal predecessors, (8493), 1690 states have call successors, (1690), 729 states have call predecessors, (1690), 746 states have return successors, (1758), 1675 states have call predecessors, (1758), 1689 states have call successors, (1758) [2024-10-24 13:40:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 11941 transitions. [2024-10-24 13:40:57,031 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 11941 transitions. Word has length 121 [2024-10-24 13:40:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:40:57,031 INFO L471 AbstractCegarLoop]: Abstraction has 8755 states and 11941 transitions. [2024-10-24 13:40:57,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 13:40:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 11941 transitions. [2024-10-24 13:40:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 13:40:57,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:40:57,040 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:40:57,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 13:40:57,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:40:57,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:40:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1031158273, now seen corresponding path program 1 times [2024-10-24 13:40:57,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:40:57,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113710288] [2024-10-24 13:40:57,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:40:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:40:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:40:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:40:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 13:40:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:40:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 13:40:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:40:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:40:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 13:40:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 13:40:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 13:40:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:40:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:40:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-24 13:40:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:40:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113710288] [2024-10-24 13:40:57,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113710288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:40:57,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:40:57,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:40:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562929077] [2024-10-24 13:40:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:40:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:40:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:40:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:40:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:40:57,277 INFO L87 Difference]: Start difference. First operand 8755 states and 11941 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 13:41:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:05,136 INFO L93 Difference]: Finished difference Result 17288 states and 23914 transitions. [2024-10-24 13:41:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 13:41:05,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2024-10-24 13:41:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:05,162 INFO L225 Difference]: With dead ends: 17288 [2024-10-24 13:41:05,163 INFO L226 Difference]: Without dead ends: 9120 [2024-10-24 13:41:05,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:41:05,177 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 1048 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:05,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2977 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-24 13:41:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2024-10-24 13:41:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 8240. [2024-10-24 13:41:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 5962 states have (on average 1.3403220395840323) internal successors, (7991), 6083 states have internal predecessors, (7991), 1585 states have call successors, (1585), 675 states have call predecessors, (1585), 692 states have return successors, (1653), 1571 states have call predecessors, (1653), 1584 states have call successors, (1653) [2024-10-24 13:41:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 11229 transitions. [2024-10-24 13:41:05,727 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 11229 transitions. Word has length 123 [2024-10-24 13:41:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:05,728 INFO L471 AbstractCegarLoop]: Abstraction has 8240 states and 11229 transitions. [2024-10-24 13:41:05,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 13:41:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 11229 transitions. [2024-10-24 13:41:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 13:41:05,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:05,738 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:41:05,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 13:41:05,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:05,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1250012991, now seen corresponding path program 1 times [2024-10-24 13:41:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:05,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151347348] [2024-10-24 13:41:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:41:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:41:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 13:41:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:41:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 13:41:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 13:41:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 13:41:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 13:41:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:41:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 13:41:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:05,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151347348] [2024-10-24 13:41:05,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151347348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:05,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 13:41:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623803516] [2024-10-24 13:41:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:05,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 13:41:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:05,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 13:41:05,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 13:41:05,988 INFO L87 Difference]: Start difference. First operand 8240 states and 11229 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 13:41:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:12,227 INFO L93 Difference]: Finished difference Result 21597 states and 29890 transitions. [2024-10-24 13:41:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 13:41:12,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2024-10-24 13:41:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:12,283 INFO L225 Difference]: With dead ends: 21597 [2024-10-24 13:41:12,284 INFO L226 Difference]: Without dead ends: 13944 [2024-10-24 13:41:12,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 13:41:12,305 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 1520 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:12,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2745 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-24 13:41:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13944 states. [2024-10-24 13:41:13,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13944 to 12575. [2024-10-24 13:41:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12575 states, 9121 states have (on average 1.3416292073237583) internal successors, (12237), 9312 states have internal predecessors, (12237), 2398 states have call successors, (2398), 1029 states have call predecessors, (2398), 1055 states have return successors, (2502), 2365 states have call predecessors, (2502), 2397 states have call successors, (2502) [2024-10-24 13:41:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12575 states to 12575 states and 17137 transitions. [2024-10-24 13:41:13,186 INFO L78 Accepts]: Start accepts. Automaton has 12575 states and 17137 transitions. Word has length 123 [2024-10-24 13:41:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:13,187 INFO L471 AbstractCegarLoop]: Abstraction has 12575 states and 17137 transitions. [2024-10-24 13:41:13,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 13:41:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 12575 states and 17137 transitions. [2024-10-24 13:41:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 13:41:13,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:13,202 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:41:13,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 13:41:13,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1969647923, now seen corresponding path program 1 times [2024-10-24 13:41:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391755232] [2024-10-24 13:41:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 13:41:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 13:41:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 13:41:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 13:41:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 13:41:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 13:41:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:41:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 13:41:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 13:41:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 13:41:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 13:41:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391755232] [2024-10-24 13:41:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391755232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 13:41:13,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221837788] [2024-10-24 13:41:13,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:13,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 13:41:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 13:41:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:41:13,502 INFO L87 Difference]: Start difference. First operand 12575 states and 17137 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 13:41:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:23,179 INFO L93 Difference]: Finished difference Result 42578 states and 60996 transitions. [2024-10-24 13:41:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 13:41:23,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-10-24 13:41:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:23,287 INFO L225 Difference]: With dead ends: 42578 [2024-10-24 13:41:23,287 INFO L226 Difference]: Without dead ends: 30018 [2024-10-24 13:41:23,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-10-24 13:41:23,318 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 2505 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 1309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 4161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1309 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:23,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 2896 Invalid, 4161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1309 Valid, 2852 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-10-24 13:41:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30018 states. [2024-10-24 13:41:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30018 to 16649. [2024-10-24 13:41:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16649 states, 12147 states have (on average 1.3423067424055322) internal successors, (16305), 12394 states have internal predecessors, (16305), 3106 states have call successors, (3106), 1357 states have call predecessors, (3106), 1395 states have return successors, (3244), 3069 states have call predecessors, (3244), 3105 states have call successors, (3244) [2024-10-24 13:41:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 22655 transitions. [2024-10-24 13:41:25,564 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 22655 transitions. Word has length 127 [2024-10-24 13:41:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:25,564 INFO L471 AbstractCegarLoop]: Abstraction has 16649 states and 22655 transitions. [2024-10-24 13:41:25,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 13:41:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 22655 transitions. [2024-10-24 13:41:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 13:41:25,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:25,579 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:41:25,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 13:41:25,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:25,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 931110721, now seen corresponding path program 2 times [2024-10-24 13:41:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268344356] [2024-10-24 13:41:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:41:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:41:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 13:41:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 13:41:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 13:41:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 13:41:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:41:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 13:41:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 13:41:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 13:41:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-24 13:41:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268344356] [2024-10-24 13:41:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268344356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 13:41:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075940396] [2024-10-24 13:41:25,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 13:41:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 13:41:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:41:25,822 INFO L87 Difference]: Start difference. First operand 16649 states and 22655 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)