./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 04:25:24,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:25:24,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 04:25:24,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:25:24,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:25:24,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:25:24,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:25:24,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:25:24,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 04:25:24,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 04:25:24,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:25:24,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:25:24,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:25:24,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:25:24,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 04:25:24,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:25:24,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:25:24,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:25:24,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:25:24,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:25:24,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:25:24,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:25:24,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:25:24,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:25:24,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:25:24,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:25:24,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:25:24,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:25:24,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:25:24,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:25:24,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:25:24,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:25:24,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:25:24,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 04:25:24,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:25:24,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:25:24,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 04:25:24,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 04:25:24,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:25:24,529 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cac8187c908783c6da6279dd5046ee81ec4fe5bbaff4f4fff097111c44b0a84 [2024-11-09 04:25:24,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:25:24,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:25:24,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:25:24,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:25:24,825 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:25:24,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-11-09 04:25:26,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:25:26,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:25:26,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-11-09 04:25:26,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82d684d9/d5bba59231b44ab88e66096f6a5642a7/FLAG4eb1c4f7d [2024-11-09 04:25:26,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82d684d9/d5bba59231b44ab88e66096f6a5642a7 [2024-11-09 04:25:26,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:25:26,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:25:26,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:25:26,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:25:26,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:25:26,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:25:26" (1/1) ... [2024-11-09 04:25:26,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df16a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:26, skipping insertion in model container [2024-11-09 04:25:26,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:25:26" (1/1) ... [2024-11-09 04:25:26,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:25:27,246 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2024-11-09 04:25:27,247 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2024-11-09 04:25:27,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2024-11-09 04:25:27,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:25:27,642 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:25:27,704 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2024-11-09 04:25:27,705 WARN L1351 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2024-11-09 04:25:27,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2024-11-09 04:25:27,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2024-11-09 04:25:27,712 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2024-11-09 04:25:27,713 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2024-11-09 04:25:27,715 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)); [1902] [2024-11-09 04:25:27,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2024-11-09 04:25:27,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:25:27,837 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:25:27,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27 WrapperNode [2024-11-09 04:25:27,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:25:27,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:25:27,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:25:27,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:25:27,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:27,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:27,989 INFO L138 Inliner]: procedures = 114, calls = 293, calls flagged for inlining = 50, calls inlined = 38, statements flattened = 960 [2024-11-09 04:25:27,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:25:27,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:25:27,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:25:27,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:25:28,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,084 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 1, 12, 4, 1, 1, 24, 4, 1, 12, 5, 2, 0, 10]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 0, 1, 4, 1, 1, 18, 4, 1, 12, 0, 1, 0, 10]. The 9 writes are split as follows [0, 1, 4, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0]. [2024-11-09 04:25:28,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:25:28,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:25:28,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:25:28,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:25:28,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (1/1) ... [2024-11-09 04:25:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:25:28,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:25:28,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 04:25:28,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 04:25:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2024-11-09 04:25:28,255 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2024-11-09 04:25:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2024-11-09 04:25:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2024-11-09 04:25:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-09 04:25:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-09 04:25:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 04:25:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 04:25:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 04:25:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 04:25:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 04:25:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 04:25:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 04:25:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 04:25:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 04:25:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 04:25:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 04:25:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 04:25:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 04:25:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 04:25:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2024-11-09 04:25:28,258 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2024-11-09 04:25:28,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2024-11-09 04:25:28,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2024-11-09 04:25:28,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 04:25:28,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 04:25:28,259 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2024-11-09 04:25:28,259 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2024-11-09 04:25:28,259 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2024-11-09 04:25:28,259 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2024-11-09 04:25:28,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-11-09 04:25:28,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-11-09 04:25:28,260 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-09 04:25:28,260 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-09 04:25:28,260 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2024-11-09 04:25:28,260 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2024-11-09 04:25:28,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 04:25:28,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 04:25:28,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 04:25:28,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 04:25:28,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 04:25:28,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 04:25:28,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 04:25:28,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 04:25:28,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-09 04:25:28,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-09 04:25:28,263 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2024-11-09 04:25:28,263 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2024-11-09 04:25:28,263 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2024-11-09 04:25:28,263 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2024-11-09 04:25:28,263 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2024-11-09 04:25:28,264 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2024-11-09 04:25:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:25:28,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:25:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:25:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2024-11-09 04:25:28,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2024-11-09 04:25:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:25:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2024-11-09 04:25:28,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2024-11-09 04:25:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 04:25:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 04:25:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 04:25:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 04:25:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 04:25:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 04:25:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 04:25:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 04:25:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 04:25:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 04:25:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 04:25:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 04:25:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 04:25:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 04:25:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:25:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2024-11-09 04:25:28,268 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2024-11-09 04:25:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 04:25:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 04:25:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 04:25:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 04:25:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 04:25:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 04:25:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 04:25:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 04:25:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 04:25:28,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2024-11-09 04:25:28,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2024-11-09 04:25:28,270 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:25:28,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-09 04:25:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-09 04:25:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-09 04:25:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-09 04:25:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-09 04:25:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-09 04:25:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2024-11-09 04:25:28,273 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2024-11-09 04:25:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-09 04:25:28,274 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-09 04:25:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-11-09 04:25:28,274 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-11-09 04:25:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2024-11-09 04:25:28,274 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2024-11-09 04:25:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2024-11-09 04:25:28,274 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2024-11-09 04:25:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 04:25:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 04:25:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 04:25:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 04:25:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 04:25:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 04:25:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 04:25:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 04:25:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-09 04:25:28,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-09 04:25:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2024-11-09 04:25:28,277 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2024-11-09 04:25:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:25:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:25:28,571 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:25:28,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:25:28,606 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-09 04:25:29,525 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2024-11-09 04:25:29,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:25:29,554 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:25:29,558 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 04:25:29,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:25:29 BoogieIcfgContainer [2024-11-09 04:25:29,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:25:29,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:25:29,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:25:29,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:25:29,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:25:26" (1/3) ... [2024-11-09 04:25:29,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd15452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:25:29, skipping insertion in model container [2024-11-09 04:25:29,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:25:27" (2/3) ... [2024-11-09 04:25:29,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd15452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:25:29, skipping insertion in model container [2024-11-09 04:25:29,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:25:29" (3/3) ... [2024-11-09 04:25:29,569 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-11-09 04:25:29,585 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:25:29,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:25:29,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:25:29,669 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;@405bca3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:25:29,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:25:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 380 states, 281 states have (on average 1.387900355871886) internal successors, (390), 294 states have internal predecessors, (390), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 04:25:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 04:25:29,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:29,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:29,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:29,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 799306126, now seen corresponding path program 1 times [2024-11-09 04:25:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:29,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718297916] [2024-11-09 04:25:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 04:25:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718297916] [2024-11-09 04:25:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718297916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:30,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:25:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379345606] [2024-11-09 04:25:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:25:30,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:25:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:25:30,415 INFO L87 Difference]: Start difference. First operand has 380 states, 281 states have (on average 1.387900355871886) internal successors, (390), 294 states have internal predecessors, (390), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 04:25:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:31,587 INFO L93 Difference]: Finished difference Result 1117 states and 1567 transitions. [2024-11-09 04:25:31,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:25:31,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-09 04:25:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:31,604 INFO L225 Difference]: With dead ends: 1117 [2024-11-09 04:25:31,604 INFO L226 Difference]: Without dead ends: 622 [2024-11-09 04:25:31,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-09 04:25:31,613 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 730 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:31,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 734 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 04:25:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-09 04:25:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 565. [2024-11-09 04:25:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 428 states have (on average 1.3644859813084111) internal successors, (584), 436 states have internal predecessors, (584), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-09 04:25:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 769 transitions. [2024-11-09 04:25:31,719 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 769 transitions. Word has length 48 [2024-11-09 04:25:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:31,721 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 769 transitions. [2024-11-09 04:25:31,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 04:25:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 769 transitions. [2024-11-09 04:25:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 04:25:31,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:31,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:31,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:25:31,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:31,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1808027181, now seen corresponding path program 1 times [2024-11-09 04:25:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309425637] [2024-11-09 04:25:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:25:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309425637] [2024-11-09 04:25:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309425637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:32,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:32,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:25:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164751207] [2024-11-09 04:25:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:32,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:25:32,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:25:32,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:25:32,016 INFO L87 Difference]: Start difference. First operand 565 states and 769 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 04:25:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:32,653 INFO L93 Difference]: Finished difference Result 1164 states and 1593 transitions. [2024-11-09 04:25:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:25:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-09 04:25:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:32,662 INFO L225 Difference]: With dead ends: 1164 [2024-11-09 04:25:32,664 INFO L226 Difference]: Without dead ends: 619 [2024-11-09 04:25:32,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-11-09 04:25:32,667 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 593 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:32,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 531 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:25:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-09 04:25:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 565. [2024-11-09 04:25:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 428 states have (on average 1.3621495327102804) internal successors, (583), 436 states have internal predecessors, (583), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-09 04:25:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 768 transitions. [2024-11-09 04:25:32,726 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 768 transitions. Word has length 54 [2024-11-09 04:25:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:32,727 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 768 transitions. [2024-11-09 04:25:32,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 04:25:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 768 transitions. [2024-11-09 04:25:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 04:25:32,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:32,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:32,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:25:32,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:32,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash 856967870, now seen corresponding path program 1 times [2024-11-09 04:25:32,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:32,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379119431] [2024-11-09 04:25:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:32,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:32,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:25:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379119431] [2024-11-09 04:25:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379119431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:25:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326865758] [2024-11-09 04:25:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:25:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:25:32,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:25:32,883 INFO L87 Difference]: Start difference. First operand 565 states and 768 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 04:25:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:33,538 INFO L93 Difference]: Finished difference Result 624 states and 851 transitions. [2024-11-09 04:25:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:25:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-09 04:25:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:33,546 INFO L225 Difference]: With dead ends: 624 [2024-11-09 04:25:33,546 INFO L226 Difference]: Without dead ends: 620 [2024-11-09 04:25:33,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-09 04:25:33,549 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 159 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:33,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 825 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:25:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-09 04:25:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 566. [2024-11-09 04:25:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 429 states have (on average 1.358974358974359) internal successors, (583), 437 states have internal predecessors, (583), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-09 04:25:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 768 transitions. [2024-11-09 04:25:33,593 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 768 transitions. Word has length 57 [2024-11-09 04:25:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:33,593 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 768 transitions. [2024-11-09 04:25:33,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 04:25:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 768 transitions. [2024-11-09 04:25:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 04:25:33,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:33,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:33,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:25:33,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1070037838, now seen corresponding path program 1 times [2024-11-09 04:25:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947373797] [2024-11-09 04:25:33,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:33,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:33,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:25:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:33,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947373797] [2024-11-09 04:25:33,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947373797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:33,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:33,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:25:33,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834492894] [2024-11-09 04:25:33,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:33,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:25:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:25:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:25:33,870 INFO L87 Difference]: Start difference. First operand 566 states and 768 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 04:25:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:35,016 INFO L93 Difference]: Finished difference Result 1689 states and 2353 transitions. [2024-11-09 04:25:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:25:35,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2024-11-09 04:25:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:35,024 INFO L225 Difference]: With dead ends: 1689 [2024-11-09 04:25:35,024 INFO L226 Difference]: Without dead ends: 1112 [2024-11-09 04:25:35,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:25:35,028 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 687 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:35,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1069 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 04:25:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-11-09 04:25:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1008. [2024-11-09 04:25:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 774 states have (on average 1.3888888888888888) internal successors, (1075), 790 states have internal predecessors, (1075), 162 states have call successors, (162), 71 states have call predecessors, (162), 71 states have return successors, (166), 156 states have call predecessors, (166), 157 states have call successors, (166) [2024-11-09 04:25:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1403 transitions. [2024-11-09 04:25:35,123 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1403 transitions. Word has length 59 [2024-11-09 04:25:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:35,123 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1403 transitions. [2024-11-09 04:25:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 04:25:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1403 transitions. [2024-11-09 04:25:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 04:25:35,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:35,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:25:35,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:35,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1679775061, now seen corresponding path program 1 times [2024-11-09 04:25:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563532098] [2024-11-09 04:25:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 04:25:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 04:25:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563532098] [2024-11-09 04:25:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563532098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:35,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:35,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:25:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424737321] [2024-11-09 04:25:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:35,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:25:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:25:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:25:35,310 INFO L87 Difference]: Start difference. First operand 1008 states and 1403 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:36,716 INFO L93 Difference]: Finished difference Result 3014 states and 4195 transitions. [2024-11-09 04:25:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:25:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2024-11-09 04:25:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:36,728 INFO L225 Difference]: With dead ends: 3014 [2024-11-09 04:25:36,728 INFO L226 Difference]: Without dead ends: 2026 [2024-11-09 04:25:36,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:25:36,733 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1322 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:36,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 959 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 04:25:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2024-11-09 04:25:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1789. [2024-11-09 04:25:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1378 states have (on average 1.3911465892597967) internal successors, (1917), 1406 states have internal predecessors, (1917), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 272 states have call predecessors, (282), 278 states have call successors, (282) [2024-11-09 04:25:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2482 transitions. [2024-11-09 04:25:36,872 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2482 transitions. Word has length 74 [2024-11-09 04:25:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:36,872 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2482 transitions. [2024-11-09 04:25:36,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2482 transitions. [2024-11-09 04:25:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 04:25:36,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:36,878 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 04:25:36,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:25:36,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:36,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -78255652, now seen corresponding path program 1 times [2024-11-09 04:25:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382748638] [2024-11-09 04:25:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:37,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 04:25:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 04:25:37,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:37,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382748638] [2024-11-09 04:25:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382748638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:25:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839646676] [2024-11-09 04:25:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:37,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:25:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:37,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:25:37,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:25:37,030 INFO L87 Difference]: Start difference. First operand 1789 states and 2482 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:37,937 INFO L93 Difference]: Finished difference Result 3760 states and 5234 transitions. [2024-11-09 04:25:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:25:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2024-11-09 04:25:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:37,948 INFO L225 Difference]: With dead ends: 3760 [2024-11-09 04:25:37,949 INFO L226 Difference]: Without dead ends: 1991 [2024-11-09 04:25:37,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:25:37,954 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 512 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:37,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 965 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:25:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2024-11-09 04:25:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1793. [2024-11-09 04:25:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1382 states have (on average 1.390014471780029) internal successors, (1921), 1410 states have internal predecessors, (1921), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 272 states have call predecessors, (282), 278 states have call successors, (282) [2024-11-09 04:25:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2486 transitions. [2024-11-09 04:25:38,055 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2486 transitions. Word has length 78 [2024-11-09 04:25:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2486 transitions. [2024-11-09 04:25:38,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2486 transitions. [2024-11-09 04:25:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 04:25:38,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:38,060 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 04:25:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:25:38,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -93774370, now seen corresponding path program 1 times [2024-11-09 04:25:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320623531] [2024-11-09 04:25:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 04:25:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 04:25:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320623531] [2024-11-09 04:25:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320623531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:38,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:38,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:25:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497703953] [2024-11-09 04:25:38,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:38,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:25:38,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:25:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:25:38,262 INFO L87 Difference]: Start difference. First operand 1793 states and 2486 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:39,282 INFO L93 Difference]: Finished difference Result 3776 states and 5250 transitions. [2024-11-09 04:25:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:25:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2024-11-09 04:25:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:39,293 INFO L225 Difference]: With dead ends: 3776 [2024-11-09 04:25:39,293 INFO L226 Difference]: Without dead ends: 1943 [2024-11-09 04:25:39,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:25:39,299 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 497 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:39,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1209 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:25:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-11-09 04:25:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1741. [2024-11-09 04:25:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1350 states have (on average 1.3903703703703705) internal successors, (1877), 1378 states have internal predecessors, (1877), 263 states have call successors, (263), 130 states have call predecessors, (263), 127 states have return successors, (262), 252 states have call predecessors, (262), 258 states have call successors, (262) [2024-11-09 04:25:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2402 transitions. [2024-11-09 04:25:39,396 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2402 transitions. Word has length 78 [2024-11-09 04:25:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:39,396 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2402 transitions. [2024-11-09 04:25:39,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2402 transitions. [2024-11-09 04:25:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 04:25:39,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:39,400 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, 1, 1, 1] [2024-11-09 04:25:39,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 04:25:39,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1018381759, now seen corresponding path program 1 times [2024-11-09 04:25:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530475476] [2024-11-09 04:25:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 04:25:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 04:25:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530475476] [2024-11-09 04:25:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530475476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:39,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:39,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:25:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404471815] [2024-11-09 04:25:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:39,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:25:39,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:39,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:25:39,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:25:39,532 INFO L87 Difference]: Start difference. First operand 1741 states and 2402 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:40,688 INFO L93 Difference]: Finished difference Result 5282 states and 7290 transitions. [2024-11-09 04:25:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:25:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 80 [2024-11-09 04:25:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:40,709 INFO L225 Difference]: With dead ends: 5282 [2024-11-09 04:25:40,710 INFO L226 Difference]: Without dead ends: 3561 [2024-11-09 04:25:40,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:25:40,717 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 966 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:40,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1009 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:25:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2024-11-09 04:25:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3132. [2024-11-09 04:25:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2426 states have (on average 1.3845836768342952) internal successors, (3359), 2478 states have internal predecessors, (3359), 468 states have call successors, (468), 238 states have call predecessors, (468), 237 states have return successors, (471), 451 states have call predecessors, (471), 463 states have call successors, (471) [2024-11-09 04:25:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4298 transitions. [2024-11-09 04:25:40,902 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4298 transitions. Word has length 80 [2024-11-09 04:25:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:40,903 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4298 transitions. [2024-11-09 04:25:40,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:25:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4298 transitions. [2024-11-09 04:25:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 04:25:40,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:40,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:40,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:25:40,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash 243723226, now seen corresponding path program 1 times [2024-11-09 04:25:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459460953] [2024-11-09 04:25:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 04:25:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 04:25:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 04:25:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 04:25:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459460953] [2024-11-09 04:25:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459460953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:41,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:25:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63327810] [2024-11-09 04:25:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:41,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:25:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:25:41,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:25:41,212 INFO L87 Difference]: Start difference. First operand 3132 states and 4298 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:25:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:43,009 INFO L93 Difference]: Finished difference Result 8537 states and 11810 transitions. [2024-11-09 04:25:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:25:43,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-09 04:25:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:43,041 INFO L225 Difference]: With dead ends: 8537 [2024-11-09 04:25:43,042 INFO L226 Difference]: Without dead ends: 5425 [2024-11-09 04:25:43,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 04:25:43,057 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1168 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:43,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1634 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 04:25:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2024-11-09 04:25:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 4704. [2024-11-09 04:25:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4704 states, 3662 states have (on average 1.3798470780993992) internal successors, (5053), 3742 states have internal predecessors, (5053), 687 states have call successors, (687), 353 states have call predecessors, (687), 354 states have return successors, (694), 664 states have call predecessors, (694), 682 states have call successors, (694) [2024-11-09 04:25:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 6434 transitions. [2024-11-09 04:25:43,462 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 6434 transitions. Word has length 129 [2024-11-09 04:25:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:43,463 INFO L471 AbstractCegarLoop]: Abstraction has 4704 states and 6434 transitions. [2024-11-09 04:25:43,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:25:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 6434 transitions. [2024-11-09 04:25:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 04:25:43,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:43,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:43,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:25:43,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:43,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1322906640, now seen corresponding path program 1 times [2024-11-09 04:25:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:43,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678377405] [2024-11-09 04:25:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 04:25:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 04:25:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 04:25:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 04:25:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:25:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678377405] [2024-11-09 04:25:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678377405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:43,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:25:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346091713] [2024-11-09 04:25:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:43,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:25:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:43,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:25:43,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:25:43,743 INFO L87 Difference]: Start difference. First operand 4704 states and 6434 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:25:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:45,879 INFO L93 Difference]: Finished difference Result 12798 states and 17655 transitions. [2024-11-09 04:25:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:25:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2024-11-09 04:25:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:45,935 INFO L225 Difference]: With dead ends: 12798 [2024-11-09 04:25:45,935 INFO L226 Difference]: Without dead ends: 8114 [2024-11-09 04:25:45,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:25:45,953 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 961 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:45,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1939 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 04:25:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2024-11-09 04:25:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 7055. [2024-11-09 04:25:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7055 states, 5518 states have (on average 1.3754983689742661) internal successors, (7590), 5640 states have internal predecessors, (7590), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1021), 976 states have call predecessors, (1021), 1003 states have call successors, (1021) [2024-11-09 04:25:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7055 states to 7055 states and 9619 transitions. [2024-11-09 04:25:46,581 INFO L78 Accepts]: Start accepts. Automaton has 7055 states and 9619 transitions. Word has length 135 [2024-11-09 04:25:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:46,582 INFO L471 AbstractCegarLoop]: Abstraction has 7055 states and 9619 transitions. [2024-11-09 04:25:46,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:25:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7055 states and 9619 transitions. [2024-11-09 04:25:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 04:25:46,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:46,592 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:46,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:25:46,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1780472740, now seen corresponding path program 1 times [2024-11-09 04:25:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677480467] [2024-11-09 04:25:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 04:25:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 04:25:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 04:25:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 04:25:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:25:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677480467] [2024-11-09 04:25:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677480467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:25:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484047243] [2024-11-09 04:25:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:46,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:25:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:25:47,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:25:47,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:25:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:47,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:25:47,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:25:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 04:25:47,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:25:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484047243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:47,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:25:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 04:25:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255564462] [2024-11-09 04:25:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:47,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:25:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:25:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:25:47,493 INFO L87 Difference]: Start difference. First operand 7055 states and 9619 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:25:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:47,994 INFO L93 Difference]: Finished difference Result 14198 states and 19377 transitions. [2024-11-09 04:25:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:25:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 139 [2024-11-09 04:25:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:48,040 INFO L225 Difference]: With dead ends: 14198 [2024-11-09 04:25:48,040 INFO L226 Difference]: Without dead ends: 7001 [2024-11-09 04:25:48,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:25:48,068 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:48,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1891 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:25:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2024-11-09 04:25:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 7001. [2024-11-09 04:25:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7001 states, 5464 states have (on average 1.3726207906295753) internal successors, (7500), 5595 states have internal predecessors, (7500), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 967 states have call predecessors, (1012), 994 states have call successors, (1012) [2024-11-09 04:25:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 9520 transitions. [2024-11-09 04:25:48,588 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 9520 transitions. Word has length 139 [2024-11-09 04:25:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:48,588 INFO L471 AbstractCegarLoop]: Abstraction has 7001 states and 9520 transitions. [2024-11-09 04:25:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:25:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 9520 transitions. [2024-11-09 04:25:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 04:25:48,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:48,598 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:48,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:25:48,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 04:25:48,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:48,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:48,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1790675275, now seen corresponding path program 1 times [2024-11-09 04:25:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129855209] [2024-11-09 04:25:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:48,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 04:25:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 04:25:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 04:25:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 04:25:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 04:25:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129855209] [2024-11-09 04:25:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129855209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:25:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518932910] [2024-11-09 04:25:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:25:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:25:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:25:49,089 INFO L87 Difference]: Start difference. First operand 7001 states and 9520 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:25:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:50,454 INFO L93 Difference]: Finished difference Result 14960 states and 20448 transitions. [2024-11-09 04:25:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:25:50,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 141 [2024-11-09 04:25:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:50,496 INFO L225 Difference]: With dead ends: 14960 [2024-11-09 04:25:50,496 INFO L226 Difference]: Without dead ends: 7979 [2024-11-09 04:25:50,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:25:50,516 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 899 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:50,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1062 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 04:25:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7979 states. [2024-11-09 04:25:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7979 to 6965. [2024-11-09 04:25:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 5428 states have (on average 1.3684598378776713) internal successors, (7428), 5559 states have internal predecessors, (7428), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 967 states have call predecessors, (1012), 994 states have call successors, (1012) [2024-11-09 04:25:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 9448 transitions. [2024-11-09 04:25:51,125 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 9448 transitions. Word has length 141 [2024-11-09 04:25:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:51,126 INFO L471 AbstractCegarLoop]: Abstraction has 6965 states and 9448 transitions. [2024-11-09 04:25:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:25:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 9448 transitions. [2024-11-09 04:25:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 04:25:51,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:51,138 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:51,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:25:51,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:51,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1600459861, now seen corresponding path program 1 times [2024-11-09 04:25:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822719974] [2024-11-09 04:25:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 04:25:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 04:25:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 04:25:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 04:25:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:25:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822719974] [2024-11-09 04:25:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822719974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:25:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431202393] [2024-11-09 04:25:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:25:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:25:51,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:25:51,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:25:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:51,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:25:51,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:25:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:25:51,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:25:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431202393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:25:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-09 04:25:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554973131] [2024-11-09 04:25:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:25:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:25:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:25:51,928 INFO L87 Difference]: Start difference. First operand 6965 states and 9448 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 04:25:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:53,397 INFO L93 Difference]: Finished difference Result 20826 states and 28263 transitions. [2024-11-09 04:25:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:25:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 142 [2024-11-09 04:25:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:53,482 INFO L225 Difference]: With dead ends: 20826 [2024-11-09 04:25:53,482 INFO L226 Difference]: Without dead ends: 20791 [2024-11-09 04:25:53,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:25:53,498 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 866 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:53,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1649 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:25:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20791 states. [2024-11-09 04:25:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20791 to 20641. [2024-11-09 04:25:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20641 states, 16064 states have (on average 1.3723232071713147) internal successors, (22045), 16457 states have internal predecessors, (22045), 3000 states have call successors, (3000), 1554 states have call predecessors, (3000), 1576 states have return successors, (3022), 2887 states have call predecessors, (3022), 2968 states have call successors, (3022) [2024-11-09 04:25:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20641 states to 20641 states and 28067 transitions. [2024-11-09 04:25:55,088 INFO L78 Accepts]: Start accepts. Automaton has 20641 states and 28067 transitions. Word has length 142 [2024-11-09 04:25:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 20641 states and 28067 transitions. [2024-11-09 04:25:55,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 04:25:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 20641 states and 28067 transitions. [2024-11-09 04:25:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 04:25:55,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:55,115 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:55,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:25:55,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 04:25:55,316 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash -617781953, now seen corresponding path program 1 times [2024-11-09 04:25:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376374519] [2024-11-09 04:25:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 04:25:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 04:25:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 04:25:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 04:25:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 04:25:55,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376374519] [2024-11-09 04:25:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376374519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:55,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:25:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57075305] [2024-11-09 04:25:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:55,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:25:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:25:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:25:55,584 INFO L87 Difference]: Start difference. First operand 20641 states and 28067 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:25:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:25:57,215 INFO L93 Difference]: Finished difference Result 27346 states and 37410 transitions. [2024-11-09 04:25:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:25:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 151 [2024-11-09 04:25:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:25:57,254 INFO L225 Difference]: With dead ends: 27346 [2024-11-09 04:25:57,254 INFO L226 Difference]: Without dead ends: 6538 [2024-11-09 04:25:57,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:25:57,305 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1048 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:25:57,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 932 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 04:25:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2024-11-09 04:25:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6358. [2024-11-09 04:25:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6358 states, 5090 states have (on average 1.4011787819253438) internal successors, (7132), 5204 states have internal predecessors, (7132), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 790 states have call predecessors, (799), 799 states have call successors, (799) [2024-11-09 04:25:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 8735 transitions. [2024-11-09 04:25:58,102 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 8735 transitions. Word has length 151 [2024-11-09 04:25:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:25:58,103 INFO L471 AbstractCegarLoop]: Abstraction has 6358 states and 8735 transitions. [2024-11-09 04:25:58,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:25:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 8735 transitions. [2024-11-09 04:25:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 04:25:58,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:25:58,123 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:25:58,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 04:25:58,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:25:58,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:25:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2059787437, now seen corresponding path program 1 times [2024-11-09 04:25:58,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:25:58,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264652074] [2024-11-09 04:25:58,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:25:58,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:25:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:25:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:25:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 04:25:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 04:25:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:25:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 04:25:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 04:25:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 04:25:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:25:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 04:25:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:25:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 04:25:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:25:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264652074] [2024-11-09 04:25:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264652074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:25:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:25:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:25:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947526406] [2024-11-09 04:25:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:25:58,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:25:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:25:58,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:25:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:25:58,503 INFO L87 Difference]: Start difference. First operand 6358 states and 8735 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:26:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:26:00,006 INFO L93 Difference]: Finished difference Result 12921 states and 17780 transitions. [2024-11-09 04:26:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:26:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 151 [2024-11-09 04:26:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:26:00,040 INFO L225 Difference]: With dead ends: 12921 [2024-11-09 04:26:00,040 INFO L226 Difference]: Without dead ends: 6583 [2024-11-09 04:26:00,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:26:00,055 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 696 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:26:00,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 999 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 04:26:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2024-11-09 04:26:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 6361. [2024-11-09 04:26:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6361 states, 5093 states have (on average 1.4009424700569408) internal successors, (7135), 5207 states have internal predecessors, (7135), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 790 states have call predecessors, (799), 799 states have call successors, (799) [2024-11-09 04:26:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8738 transitions. [2024-11-09 04:26:00,685 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8738 transitions. Word has length 151 [2024-11-09 04:26:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:26:00,685 INFO L471 AbstractCegarLoop]: Abstraction has 6361 states and 8738 transitions. [2024-11-09 04:26:00,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:26:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8738 transitions. [2024-11-09 04:26:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 04:26:00,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:26:00,704 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:26:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 04:26:00,704 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:26:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:26:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash -948182894, now seen corresponding path program 1 times [2024-11-09 04:26:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:26:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517127522] [2024-11-09 04:26:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:26:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:26:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:26:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:26:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 04:26:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 04:26:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:26:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 04:26:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:26:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:26:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 04:26:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 04:26:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 04:26:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:26:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 04:26:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:26:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 04:26:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:26:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517127522] [2024-11-09 04:26:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517127522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:26:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:26:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:26:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217101663] [2024-11-09 04:26:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:26:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:26:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:26:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:26:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:26:01,412 INFO L87 Difference]: Start difference. First operand 6361 states and 8738 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:26:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:26:02,640 INFO L93 Difference]: Finished difference Result 7138 states and 9754 transitions. [2024-11-09 04:26:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:26:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2024-11-09 04:26:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:26:02,653 INFO L225 Difference]: With dead ends: 7138 [2024-11-09 04:26:02,654 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 04:26:02,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-09 04:26:02,665 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 659 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:26:02,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 689 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:26:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 04:26:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 04:26:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:26:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 04:26:02,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2024-11-09 04:26:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:26:02,681 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 04:26:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 04:26:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 04:26:02,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 04:26:02,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:26:02,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 04:26:02,688 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:26:02,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.