./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--ems_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:20:28,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:20:28,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:20:28,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:20:28,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:20:28,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:20:28,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:20:28,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:20:28,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:20:28,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:20:28,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:20:28,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:20:28,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:20:28,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:20:28,850 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:20:28,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:20:28,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:20:28,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:20:28,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:20:28,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:20:28,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:20:28,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:20:28,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:20:28,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:20:28,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:20:28,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:20:28,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:20:28,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:20:28,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:20:28,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:20:28,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:20:28,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:20:28,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:20:28,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:20:28,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:20:28,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:20:28,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:20:28,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:20:28,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:20:28,859 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 [2024-10-11 15:20:29,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:20:29,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:20:29,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:20:29,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:20:29,068 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:20:29,069 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--ems_usb.ko-entry_point.cil.out.i [2024-10-11 15:20:30,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:20:30,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:20:30,606 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--ems_usb.ko-entry_point.cil.out.i [2024-10-11 15:20:30,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b516be7d5/7e7c6e18dc6c4b50bd560330d4ba97fb/FLAG9e6d3575d [2024-10-11 15:20:30,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b516be7d5/7e7c6e18dc6c4b50bd560330d4ba97fb [2024-10-11 15:20:30,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:20:30,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:20:30,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:20:30,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:20:30,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:20:30,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:30" (1/1) ... [2024-10-11 15:20:30,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16588836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:30, skipping insertion in model container [2024-10-11 15:20:30,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:20:30" (1/1) ... [2024-10-11 15:20:30,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:20:31,449 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--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2024-10-11 15:20:31,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:20:31,855 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:20:31,917 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"); [5441] [2024-10-11 15:20:31,919 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)); [5448] [2024-10-11 15:20:31,919 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"); [5456-5457] [2024-10-11 15:20:31,920 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)); [5485] [2024-10-11 15:20:31,922 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)); [5492] [2024-10-11 15:20:31,930 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--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2024-10-11 15:20:31,959 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/6225/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/ems_usb.o.c.prepared"), "i" (546), "i" (12UL)); [6159-6160] [2024-10-11 15:20:32,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:20:32,115 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:20:32,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32 WrapperNode [2024-10-11 15:20:32,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:20:32,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:20:32,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:20:32,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:20:32,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,256 INFO L138 Inliner]: procedures = 169, calls = 760, calls flagged for inlining = 78, calls inlined = 78, statements flattened = 2292 [2024-10-11 15:20:32,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:20:32,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:20:32,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:20:32,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:20:32,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,468 INFO L175 MemorySlicer]: Split 446 memory accesses to 8 slices as follows [2, 20, 9, 42, 20, 9, 336, 8]. 75 percent of accesses are in the largest equivalence class. The 140 initializations are split as follows [2, 0, 0, 42, 0, 0, 88, 8]. The 120 writes are split as follows [0, 0, 5, 0, 11, 0, 104, 0]. [2024-10-11 15:20:32,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:20:32,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:20:32,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:20:32,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:20:32,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (1/1) ... [2024-10-11 15:20:32,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:20:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:20:32,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:20:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:20:32,671 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-11 15:20:32,671 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-11 15:20:32,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:20:32,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_18 [2024-10-11 15:20:32,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_18 [2024-10-11 15:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2024-10-11 15:20:32,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2024-10-11 15:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2024-10-11 15:20:32,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2024-10-11 15:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2024-10-11 15:20:32,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2024-10-11 15:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:20:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:20:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:20:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:20:32,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:20:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-11 15:20:32,678 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_bulk_callback [2024-10-11 15:20:32,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_bulk_callback [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2024-10-11 15:20:32,678 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2024-10-11 15:20:32,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2024-10-11 15:20:32,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2024-10-11 15:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2024-10-11 15:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2024-10-11 15:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-11 15:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-11 15:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2024-10-11 15:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2024-10-11 15:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-11 15:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-11 15:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-11 15:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-11 15:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-11 15:20:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:20:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2024-10-11 15:20:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2024-10-11 15:20:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:20:32,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:20:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-11 15:20:32,683 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-11 15:20:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-11 15:20:32,683 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-11 15:20:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:20:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:20:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:20:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_disconnect [2024-10-11 15:20:32,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_disconnect [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-11 15:20:32,684 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2024-10-11 15:20:32,684 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2024-10-11 15:20:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_interrupt_callback [2024-10-11 15:20:32,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_interrupt_callback [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-11 15:20:32,685 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-10-11 15:20:32,685 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:20:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_rx_err [2024-10-11 15:20:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_rx_err [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 15:20:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2024-10-11 15:20:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-11 15:20:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-11 15:20:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-11 15:20:32,686 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-11 15:20:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-11 15:20:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-11 15:20:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-11 15:20:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-11 15:20:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-11 15:20:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-11 15:20:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2024-10-11 15:20:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2024-10-11 15:20:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2024-10-11 15:20:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2024-10-11 15:20:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-11 15:20:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-11 15:20:32,688 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-11 15:20:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 15:20:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 15:20:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:20:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:20:33,065 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:20:33,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:20:33,114 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:20:33,453 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2024-10-11 15:20:34,887 INFO L? ?]: Removed 985 outVars from TransFormulas that were not future-live. [2024-10-11 15:20:34,887 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:20:35,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:20:35,045 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 15:20:35,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:35 BoogieIcfgContainer [2024-10-11 15:20:35,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:20:35,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:20:35,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:20:35,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:20:35,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:20:30" (1/3) ... [2024-10-11 15:20:35,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d75ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:35, skipping insertion in model container [2024-10-11 15:20:35,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:20:32" (2/3) ... [2024-10-11 15:20:35,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d75ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:20:35, skipping insertion in model container [2024-10-11 15:20:35,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:20:35" (3/3) ... [2024-10-11 15:20:35,053 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2024-10-11 15:20:35,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:20:35,066 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:20:35,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:20:35,146 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;@1d0c279b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:20:35,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:20:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 672 states, 463 states have (on average 1.42548596112311) internal successors, (660), 489 states have internal predecessors, (660), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) [2024-10-11 15:20:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 15:20:35,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:35,163 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-11 15:20:35,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:35,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1533492630, now seen corresponding path program 1 times [2024-10-11 15:20:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025942388] [2024-10-11 15:20:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:35,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:35,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 15:20:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:35,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025942388] [2024-10-11 15:20:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025942388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:35,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327837677] [2024-10-11 15:20:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:35,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:35,714 INFO L87 Difference]: Start difference. First operand has 672 states, 463 states have (on average 1.42548596112311) internal successors, (660), 489 states have internal predecessors, (660), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) 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-11 15:20:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:39,633 INFO L93 Difference]: Finished difference Result 2137 states and 3192 transitions. [2024-10-11 15:20:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:20:39,635 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-11 15:20:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:39,654 INFO L225 Difference]: With dead ends: 2137 [2024-10-11 15:20:39,654 INFO L226 Difference]: Without dead ends: 1447 [2024-10-11 15:20:39,660 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-11 15:20:39,662 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 1295 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:39,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 1763 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 15:20:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-10-11 15:20:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1297. [2024-10-11 15:20:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 905 states have (on average 1.3734806629834253) internal successors, (1243), 937 states have internal predecessors, (1243), 293 states have call successors, (293), 99 states have call predecessors, (293), 98 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-11 15:20:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1824 transitions. [2024-10-11 15:20:39,803 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1824 transitions. Word has length 23 [2024-10-11 15:20:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1824 transitions. [2024-10-11 15:20:39,804 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-11 15:20:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1824 transitions. [2024-10-11 15:20:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 15:20:39,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:39,806 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-11 15:20:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:20:39,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash 995292954, now seen corresponding path program 1 times [2024-10-11 15:20:39,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974820405] [2024-10-11 15:20:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:20:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:40,087 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-11 15:20:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974820405] [2024-10-11 15:20:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974820405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:40,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:40,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738132359] [2024-10-11 15:20:40,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:40,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:40,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:40,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:40,098 INFO L87 Difference]: Start difference. First operand 1297 states and 1824 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-11 15:20:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:43,356 INFO L93 Difference]: Finished difference Result 4180 states and 6087 transitions. [2024-10-11 15:20:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:20:43,357 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-11 15:20:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:43,368 INFO L225 Difference]: With dead ends: 4180 [2024-10-11 15:20:43,368 INFO L226 Difference]: Without dead ends: 2888 [2024-10-11 15:20:43,371 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-11 15:20:43,372 INFO L432 NwaCegarLoop]: 1117 mSDtfsCounter, 1149 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:43,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 2329 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 15:20:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-11 15:20:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2692. [2024-10-11 15:20:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 1882 states have (on average 1.3719447396386824) internal successors, (2582), 1954 states have internal predecessors, (2582), 599 states have call successors, (599), 197 states have call predecessors, (599), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-11 15:20:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3851 transitions. [2024-10-11 15:20:43,468 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3851 transitions. Word has length 32 [2024-10-11 15:20:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:43,468 INFO L471 AbstractCegarLoop]: Abstraction has 2692 states and 3851 transitions. [2024-10-11 15:20:43,469 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-11 15:20:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3851 transitions. [2024-10-11 15:20:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 15:20:43,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:43,472 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-11 15:20:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:20:43,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 788982468, now seen corresponding path program 1 times [2024-10-11 15:20:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660955328] [2024-10-11 15:20:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:20:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:43,738 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-11 15:20:43,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:43,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660955328] [2024-10-11 15:20:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660955328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:43,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155545098] [2024-10-11 15:20:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:43,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:43,740 INFO L87 Difference]: Start difference. First operand 2692 states and 3851 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-11 15:20:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:45,818 INFO L93 Difference]: Finished difference Result 2880 states and 4184 transitions. [2024-10-11 15:20:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:45,818 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-11 15:20:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:45,830 INFO L225 Difference]: With dead ends: 2880 [2024-10-11 15:20:45,831 INFO L226 Difference]: Without dead ends: 2877 [2024-10-11 15:20:45,831 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-11 15:20:45,832 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 1063 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:45,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1081 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 15:20:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2024-10-11 15:20:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2691. [2024-10-11 15:20:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 1882 states have (on average 1.371413390010627) internal successors, (2581), 1953 states have internal predecessors, (2581), 598 states have call successors, (598), 197 states have call predecessors, (598), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-11 15:20:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3849 transitions. [2024-10-11 15:20:45,926 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3849 transitions. Word has length 33 [2024-10-11 15:20:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:45,927 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3849 transitions. [2024-10-11 15:20:45,927 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-11 15:20:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3849 transitions. [2024-10-11 15:20:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 15:20:45,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:45,929 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-11 15:20:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:20:45,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:45,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1311670435, now seen corresponding path program 1 times [2024-10-11 15:20:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891573398] [2024-10-11 15:20:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:45,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:20:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:46,108 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-11 15:20:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891573398] [2024-10-11 15:20:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891573398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584672755] [2024-10-11 15:20:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:46,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:46,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:46,110 INFO L87 Difference]: Start difference. First operand 2691 states and 3849 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-11 15:20:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:48,374 INFO L93 Difference]: Finished difference Result 2879 states and 4182 transitions. [2024-10-11 15:20:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:48,374 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-11 15:20:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:48,386 INFO L225 Difference]: With dead ends: 2879 [2024-10-11 15:20:48,386 INFO L226 Difference]: Without dead ends: 2876 [2024-10-11 15:20:48,387 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-11 15:20:48,388 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 1061 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:48,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1080 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 15:20:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-10-11 15:20:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2690. [2024-10-11 15:20:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 1882 states have (on average 1.3708820403825717) internal successors, (2580), 1952 states have internal predecessors, (2580), 597 states have call successors, (597), 197 states have call predecessors, (597), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-11 15:20:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3847 transitions. [2024-10-11 15:20:48,511 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3847 transitions. Word has length 34 [2024-10-11 15:20:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 2690 states and 3847 transitions. [2024-10-11 15:20:48,511 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-11 15:20:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3847 transitions. [2024-10-11 15:20:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 15:20:48,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:48,514 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-11 15:20:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:20:48,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2007396121, now seen corresponding path program 1 times [2024-10-11 15:20:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185671097] [2024-10-11 15:20:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:20:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:48,648 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-11 15:20:48,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185671097] [2024-10-11 15:20:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185671097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095844213] [2024-10-11 15:20:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:48,650 INFO L87 Difference]: Start difference. First operand 2690 states and 3847 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-11 15:20:55,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:20:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:55,221 INFO L93 Difference]: Finished difference Result 2878 states and 4180 transitions. [2024-10-11 15:20:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:55,221 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-11 15:20:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:55,233 INFO L225 Difference]: With dead ends: 2878 [2024-10-11 15:20:55,233 INFO L226 Difference]: Without dead ends: 2875 [2024-10-11 15:20:55,234 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-11 15:20:55,235 INFO L432 NwaCegarLoop]: 708 mSDtfsCounter, 1056 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 282 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:55,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1076 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-10-11 15:20:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2024-10-11 15:20:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2689. [2024-10-11 15:20:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 1882 states have (on average 1.3703506907545164) internal successors, (2579), 1951 states have internal predecessors, (2579), 596 states have call successors, (596), 197 states have call predecessors, (596), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-11 15:20:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3845 transitions. [2024-10-11 15:20:55,335 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3845 transitions. Word has length 35 [2024-10-11 15:20:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:55,336 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 3845 transitions. [2024-10-11 15:20:55,336 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-11 15:20:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3845 transitions. [2024-10-11 15:20:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 15:20:55,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:55,339 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-11 15:20:55,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:20:55,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:55,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2100051040, now seen corresponding path program 1 times [2024-10-11 15:20:55,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441804372] [2024-10-11 15:20:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:20:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:55,469 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-11 15:20:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441804372] [2024-10-11 15:20:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441804372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:20:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957468718] [2024-10-11 15:20:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:55,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:20:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:20:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:20:55,471 INFO L87 Difference]: Start difference. First operand 2689 states and 3845 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-11 15:20:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:20:58,186 INFO L93 Difference]: Finished difference Result 2877 states and 4178 transitions. [2024-10-11 15:20:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:20:58,187 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-11 15:20:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:20:58,197 INFO L225 Difference]: With dead ends: 2877 [2024-10-11 15:20:58,198 INFO L226 Difference]: Without dead ends: 2868 [2024-10-11 15:20:58,198 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-11 15:20:58,200 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 1059 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:20:58,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1069 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 15:20:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2024-10-11 15:20:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2682. [2024-10-11 15:20:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 1876 states have (on average 1.3694029850746268) internal successors, (2569), 1944 states have internal predecessors, (2569), 595 states have call successors, (595), 197 states have call predecessors, (595), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-11 15:20:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3834 transitions. [2024-10-11 15:20:58,335 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 3834 transitions. Word has length 36 [2024-10-11 15:20:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:20:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 3834 transitions. [2024-10-11 15:20:58,335 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-11 15:20:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 3834 transitions. [2024-10-11 15:20:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 15:20:58,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:20:58,340 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, 1, 1, 1] [2024-10-11 15:20:58,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:20:58,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:20:58,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:20:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash -807648992, now seen corresponding path program 1 times [2024-10-11 15:20:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:20:58,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601544710] [2024-10-11 15:20:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:20:58,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:20:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 15:20:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:20:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:20:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:20:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:20:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:20:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:20:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:20:58,527 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-11 15:20:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:20:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601544710] [2024-10-11 15:20:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601544710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:20:58,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:20:58,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:20:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637404459] [2024-10-11 15:20:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:20:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:20:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:20:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:20:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:20:58,529 INFO L87 Difference]: Start difference. First operand 2682 states and 3834 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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-11 15:21:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:01,208 INFO L93 Difference]: Finished difference Result 6406 states and 9171 transitions. [2024-10-11 15:21:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:21:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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 77 [2024-10-11 15:21:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:01,222 INFO L225 Difference]: With dead ends: 6406 [2024-10-11 15:21:01,222 INFO L226 Difference]: Without dead ends: 3729 [2024-10-11 15:21:01,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:21:01,228 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 1024 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:01,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1763 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 15:21:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-11 15:21:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3388. [2024-10-11 15:21:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 2350 states have (on average 1.3548936170212766) internal successors, (3184), 2432 states have internal predecessors, (3184), 734 states have call successors, (734), 276 states have call predecessors, (734), 303 states have return successors, (847), 727 states have call predecessors, (847), 733 states have call successors, (847) [2024-10-11 15:21:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4765 transitions. [2024-10-11 15:21:01,418 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4765 transitions. Word has length 77 [2024-10-11 15:21:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4765 transitions. [2024-10-11 15:21:01,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 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-11 15:21:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4765 transitions. [2024-10-11 15:21:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 15:21:01,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:01,422 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, 1, 1, 1] [2024-10-11 15:21:01,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:21:01,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:01,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash -686984246, now seen corresponding path program 1 times [2024-10-11 15:21:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781772145] [2024-10-11 15:21:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:21:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:21:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 15:21:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 15:21:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 15:21:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:01,656 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-11 15:21:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781772145] [2024-10-11 15:21:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781772145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:01,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:21:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072008698] [2024-10-11 15:21:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:01,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:21:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:21:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:21:01,659 INFO L87 Difference]: Start difference. First operand 3388 states and 4765 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:21:11,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:21:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:11,541 INFO L93 Difference]: Finished difference Result 7878 states and 11135 transitions. [2024-10-11 15:21:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:21:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-10-11 15:21:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:11,557 INFO L225 Difference]: With dead ends: 7878 [2024-10-11 15:21:11,558 INFO L226 Difference]: Without dead ends: 4501 [2024-10-11 15:21:11,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:21:11,566 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 686 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:11,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 2765 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-10-11 15:21:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2024-10-11 15:21:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4118. [2024-10-11 15:21:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4118 states, 2856 states have (on average 1.346638655462185) internal successors, (3846), 2952 states have internal predecessors, (3846), 872 states have call successors, (872), 354 states have call predecessors, (872), 389 states have return successors, (1005), 867 states have call predecessors, (1005), 871 states have call successors, (1005) [2024-10-11 15:21:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 5723 transitions. [2024-10-11 15:21:11,820 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 5723 transitions. Word has length 89 [2024-10-11 15:21:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:11,821 INFO L471 AbstractCegarLoop]: Abstraction has 4118 states and 5723 transitions. [2024-10-11 15:21:11,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:21:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 5723 transitions. [2024-10-11 15:21:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 15:21:11,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:11,824 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:11,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:21:11,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:11,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1790961661, now seen corresponding path program 1 times [2024-10-11 15:21:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794106324] [2024-10-11 15:21:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 15:21:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:21:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:21:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 15:21:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:21:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 15:21:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:21:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:21:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:21:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 15:21:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794106324] [2024-10-11 15:21:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794106324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:12,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 15:21:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256903878] [2024-10-11 15:21:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:12,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:21:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:21:12,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:21:12,063 INFO L87 Difference]: Start difference. First operand 4118 states and 5723 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:21:18,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:21:22,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:21:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:23,342 INFO L93 Difference]: Finished difference Result 12132 states and 17449 transitions. [2024-10-11 15:21:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 15:21:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-10-11 15:21:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:23,372 INFO L225 Difference]: With dead ends: 12132 [2024-10-11 15:21:23,372 INFO L226 Difference]: Without dead ends: 8025 [2024-10-11 15:21:23,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:21:23,381 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 1910 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 942 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:23,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 2894 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [942 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-10-11 15:21:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8025 states. [2024-10-11 15:21:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8025 to 7016. [2024-10-11 15:21:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 4925 states have (on average 1.36) internal successors, (6698), 5125 states have internal predecessors, (6698), 1448 states have call successors, (1448), 535 states have call predecessors, (1448), 642 states have return successors, (1835), 1467 states have call predecessors, (1835), 1447 states have call successors, (1835) [2024-10-11 15:21:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 9981 transitions. [2024-10-11 15:21:23,786 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 9981 transitions. Word has length 97 [2024-10-11 15:21:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:23,787 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 9981 transitions. [2024-10-11 15:21:23,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:21:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 9981 transitions. [2024-10-11 15:21:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 15:21:23,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:23,794 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, 1, 1, 1] [2024-10-11 15:21:23,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:21:23,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:23,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1334245481, now seen corresponding path program 1 times [2024-10-11 15:21:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301457728] [2024-10-11 15:21:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:21:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:21:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:21:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 15:21:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:21:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:21:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:24,057 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-11 15:21:24,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301457728] [2024-10-11 15:21:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301457728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:24,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:21:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997795151] [2024-10-11 15:21:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:21:24,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:24,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:21:24,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:21:24,059 INFO L87 Difference]: Start difference. First operand 7016 states and 9981 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 15:21:30,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:21:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:33,201 INFO L93 Difference]: Finished difference Result 18778 states and 26867 transitions. [2024-10-11 15:21:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:21:33,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-10-11 15:21:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:33,240 INFO L225 Difference]: With dead ends: 18778 [2024-10-11 15:21:33,240 INFO L226 Difference]: Without dead ends: 11777 [2024-10-11 15:21:33,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:21:33,260 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 1547 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:33,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2662 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-10-11 15:21:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11777 states. [2024-10-11 15:21:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11777 to 10794. [2024-10-11 15:21:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10794 states, 7625 states have (on average 1.3635409836065573) internal successors, (10397), 7981 states have internal predecessors, (10397), 2084 states have call successors, (2084), 885 states have call predecessors, (2084), 1084 states have return successors, (2739), 2127 states have call predecessors, (2739), 2083 states have call successors, (2739) [2024-10-11 15:21:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10794 states to 10794 states and 15220 transitions. [2024-10-11 15:21:33,868 INFO L78 Accepts]: Start accepts. Automaton has 10794 states and 15220 transitions. Word has length 100 [2024-10-11 15:21:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 10794 states and 15220 transitions. [2024-10-11 15:21:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 15:21:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 10794 states and 15220 transitions. [2024-10-11 15:21:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 15:21:33,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:33,873 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:21:33,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:21:33,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:33,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1706918023, now seen corresponding path program 1 times [2024-10-11 15:21:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:33,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317094333] [2024-10-11 15:21:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:21:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:21:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:21:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 15:21:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 15:21:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:21:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 15:21:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:21:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:21:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 15:21:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 15:21:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 15:21:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317094333] [2024-10-11 15:21:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317094333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 15:21:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171894567] [2024-10-11 15:21:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:21:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:21:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:21:34,191 INFO L87 Difference]: Start difference. First operand 10794 states and 15220 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 3 states have internal predecessors, (61), 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-11 15:21:42,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:21:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:44,273 INFO L93 Difference]: Finished difference Result 23447 states and 33634 transitions. [2024-10-11 15:21:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:21:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 3 states have internal predecessors, (61), 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 109 [2024-10-11 15:21:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:44,320 INFO L225 Difference]: With dead ends: 23447 [2024-10-11 15:21:44,320 INFO L226 Difference]: Without dead ends: 12668 [2024-10-11 15:21:44,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:21:44,345 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 576 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:44,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 3064 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-10-11 15:21:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12668 states. [2024-10-11 15:21:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12668 to 10810. [2024-10-11 15:21:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10810 states, 7641 states have (on average 1.3627797408716136) internal successors, (10413), 7997 states have internal predecessors, (10413), 2084 states have call successors, (2084), 885 states have call predecessors, (2084), 1084 states have return successors, (2739), 2127 states have call predecessors, (2739), 2083 states have call successors, (2739) [2024-10-11 15:21:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10810 states to 10810 states and 15236 transitions. [2024-10-11 15:21:45,046 INFO L78 Accepts]: Start accepts. Automaton has 10810 states and 15236 transitions. Word has length 109 [2024-10-11 15:21:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:45,047 INFO L471 AbstractCegarLoop]: Abstraction has 10810 states and 15236 transitions. [2024-10-11 15:21:45,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 3 states have internal predecessors, (61), 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-11 15:21:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 10810 states and 15236 transitions. [2024-10-11 15:21:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 15:21:45,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:45,051 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:21:45,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 15:21:45,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1602126269, now seen corresponding path program 1 times [2024-10-11 15:21:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362789461] [2024-10-11 15:21:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:21:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:21:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:21:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 15:21:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 15:21:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:21:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 15:21:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:21:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:21:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:21:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 15:21:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 15:21:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362789461] [2024-10-11 15:21:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362789461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:45,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040786910] [2024-10-11 15:21:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:45,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:21:45,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:21:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:45,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:21:45,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 15:21:45,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:21:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 15:21:46,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040786910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:21:46,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:21:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2024-10-11 15:21:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871690047] [2024-10-11 15:21:46,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:21:46,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 15:21:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 15:21:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 15:21:46,010 INFO L87 Difference]: Start difference. First operand 10810 states and 15236 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 15:21:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:51,399 INFO L93 Difference]: Finished difference Result 23511 states and 33730 transitions. [2024-10-11 15:21:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:21:51,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 110 [2024-10-11 15:21:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:51,447 INFO L225 Difference]: With dead ends: 23511 [2024-10-11 15:21:51,447 INFO L226 Difference]: Without dead ends: 12716 [2024-10-11 15:21:51,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 15:21:51,472 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 828 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:51,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2360 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 15:21:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2024-10-11 15:21:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 10858. [2024-10-11 15:21:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10858 states, 7689 states have (on average 1.3605150214592274) internal successors, (10461), 8045 states have internal predecessors, (10461), 2084 states have call successors, (2084), 885 states have call predecessors, (2084), 1084 states have return successors, (2739), 2127 states have call predecessors, (2739), 2083 states have call successors, (2739) [2024-10-11 15:21:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10858 states to 10858 states and 15284 transitions. [2024-10-11 15:21:52,170 INFO L78 Accepts]: Start accepts. Automaton has 10858 states and 15284 transitions. Word has length 110 [2024-10-11 15:21:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:52,170 INFO L471 AbstractCegarLoop]: Abstraction has 10858 states and 15284 transitions. [2024-10-11 15:21:52,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 15:21:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10858 states and 15284 transitions. [2024-10-11 15:21:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 15:21:52,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:52,176 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-11 15:21:52,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 15:21:52,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 15:21:52,377 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:52,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1318002183, now seen corresponding path program 2 times [2024-10-11 15:21:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:52,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106485941] [2024-10-11 15:21:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:21:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 15:21:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:21:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 15:21:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 15:21:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:21:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 15:21:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:21:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:21:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 15:21:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 15:21:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 15:21:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106485941] [2024-10-11 15:21:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106485941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:21:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845411112] [2024-10-11 15:21:52,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 15:21:52,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:21:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:52,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:21:52,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:21:53,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 15:21:53,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 15:21:53,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 15:21:53,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:21:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 15:21:53,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:21:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 15:21:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845411112] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:21:53,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:21:53,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-10-11 15:21:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664221624] [2024-10-11 15:21:53,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:21:53,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 15:21:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 15:21:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-11 15:21:53,642 INFO L87 Difference]: Start difference. First operand 10858 states and 15284 transitions. Second operand has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 14 states have internal predecessors, (127), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31)