./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya --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 c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:10:59,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:10:59,594 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 05:10:59,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:10:59,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:10:59,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:10:59,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:10:59,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:10:59,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:10:59,625 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:10:59,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:10:59,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:10:59,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:10:59,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:10:59,628 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:10:59,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:10:59,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:10:59,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:10:59,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:10:59,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:10:59,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:10:59,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:10:59,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:10:59,632 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:10:59,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:10:59,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:10:59,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:10:59,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:10:59,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:10:59,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:10:59,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:10:59,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:10:59,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:10:59,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:10:59,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:10:59,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:10:59,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:10:59,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:10:59,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:10:59,637 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2023-11-29 05:10:59,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:10:59,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:10:59,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:10:59,873 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:10:59,873 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:10:59,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/../../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 [2023-11-29 05:11:02,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:11:02,984 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:11:02,984 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/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 [2023-11-29 05:11:03,005 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/data/b999d6b89/0a2d5608a60f4b3ca8ef6f2f7260855e/FLAG96dfce9c7 [2023-11-29 05:11:03,020 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/data/b999d6b89/0a2d5608a60f4b3ca8ef6f2f7260855e [2023-11-29 05:11:03,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:11:03,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:11:03,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:11:03,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:11:03,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:11:03,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399361e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03, skipping insertion in model container [2023-11-29 05:11:03,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,110 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:11:03,370 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2023-11-29 05:11:03,371 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2023-11-29 05:11:03,458 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/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] [2023-11-29 05:11:03,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:11:03,653 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:11:03,749 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2023-11-29 05:11:03,749 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2023-11-29 05:11:03,752 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2023-11-29 05:11:03,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2023-11-29 05:11:03,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2023-11-29 05:11:03,755 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2023-11-29 05:11:03,757 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] [2023-11-29 05:11:03,762 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/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] [2023-11-29 05:11:03,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:11:03,843 WARN L675 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:11:03,843 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:11:03,851 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:11:03,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03 WrapperNode [2023-11-29 05:11:03,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:11:03,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:11:03,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:11:03,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:11:03,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,935 INFO L138 Inliner]: procedures = 114, calls = 301, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 945 [2023-11-29 05:11:03,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:11:03,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:11:03,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:11:03,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:11:03,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,998 INFO L175 MemorySlicer]: Split 83 memory accesses to 15 slices as follows [2, 0, 5, 6, 10, 4, 1, 1, 24, 4, 1, 12, 1, 10, 2]. 29 percent of accesses are in the largest equivalence class. The 61 initializations are split as follows [2, 0, 0, 6, 10, 4, 1, 1, 18, 4, 1, 12, 0, 1, 1]. The 7 writes are split as follows [0, 0, 3, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0]. [2023-11-29 05:11:03,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:03,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:04,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:04,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:04,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:04,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:04,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:11:04,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:11:04,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:11:04,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:11:04,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (1/1) ... [2023-11-29 05:11:04,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:11:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:04,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:11:04,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:11:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2023-11-29 05:11:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2023-11-29 05:11:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2023-11-29 05:11:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2023-11-29 05:11:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 05:11:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 05:11:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:11:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:11:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:11:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:11:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 05:11:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 05:11:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 05:11:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 05:11:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 05:11:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 05:11:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 05:11:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 05:11:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 05:11:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-29 05:11:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-29 05:11:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2023-11-29 05:11:04,134 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2023-11-29 05:11:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2023-11-29 05:11:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2023-11-29 05:11:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 05:11:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 05:11:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2023-11-29 05:11:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2023-11-29 05:11:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2023-11-29 05:11:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2023-11-29 05:11:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-29 05:11:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-29 05:11:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 05:11:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 05:11:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2023-11-29 05:11:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 05:11:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-29 05:11:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-29 05:11:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 05:11:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 05:11:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2023-11-29 05:11:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2023-11-29 05:11:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2023-11-29 05:11:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2023-11-29 05:11:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2023-11-29 05:11:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2023-11-29 05:11:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:11:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:11:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:11:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2023-11-29 05:11:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2023-11-29 05:11:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-29 05:11:04,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 05:11:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 05:11:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2023-11-29 05:11:04,143 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:11:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 05:11:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2023-11-29 05:11:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2023-11-29 05:11:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2023-11-29 05:11:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 05:11:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 05:11:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-29 05:11:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-29 05:11:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2023-11-29 05:11:04,148 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2023-11-29 05:11:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 05:11:04,148 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 05:11:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-29 05:11:04,148 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-29 05:11:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2023-11-29 05:11:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2023-11-29 05:11:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:11:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 05:11:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-29 05:11:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-29 05:11:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-29 05:11:04,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-29 05:11:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2023-11-29 05:11:04,151 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2023-11-29 05:11:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:11:04,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:11:04,438 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:11:04,441 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:11:04,471 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 05:11:05,129 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:11:05,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:11:05,294 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:11:05,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:11:05 BoogieIcfgContainer [2023-11-29 05:11:05,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:11:05,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:11:05,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:11:05,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:11:05,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:11:03" (1/3) ... [2023-11-29 05:11:05,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7190d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:11:05, skipping insertion in model container [2023-11-29 05:11:05,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:03" (2/3) ... [2023-11-29 05:11:05,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7190d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:11:05, skipping insertion in model container [2023-11-29 05:11:05,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:11:05" (3/3) ... [2023-11-29 05:11:05,302 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 [2023-11-29 05:11:05,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:11:05,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:11:05,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:11:05,372 INFO L357 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, mHoare=true, 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;@369c882b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:11:05,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:11:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 219 states have (on average 1.4885844748858448) internal successors, (326), 232 states have internal predecessors, (326), 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) [2023-11-29 05:11:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 05:11:05,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:05,394 INFO L195 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] [2023-11-29 05:11:05,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:05,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1583047881, now seen corresponding path program 1 times [2023-11-29 05:11:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826231146] [2023-11-29 05:11:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:11:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:05,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:05,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826231146] [2023-11-29 05:11:05,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826231146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:11:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383629861] [2023-11-29 05:11:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:05,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:11:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:11:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:11:05,835 INFO L87 Difference]: Start difference. First operand has 318 states, 219 states have (on average 1.4885844748858448) internal successors, (326), 232 states have internal predecessors, (326), 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 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) [2023-11-29 05:11:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:07,002 INFO L93 Difference]: Finished difference Result 936 states and 1376 transitions. [2023-11-29 05:11:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:11:07,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 44 [2023-11-29 05:11:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:07,021 INFO L225 Difference]: With dead ends: 936 [2023-11-29 05:11:07,022 INFO L226 Difference]: Without dead ends: 525 [2023-11-29 05:11:07,028 INFO L412 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 [2023-11-29 05:11:07,032 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 593 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:07,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 623 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:11:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-29 05:11:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 477. [2023-11-29 05:11:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 340 states have (on average 1.4529411764705882) internal successors, (494), 348 states have internal predecessors, (494), 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) [2023-11-29 05:11:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 679 transitions. [2023-11-29 05:11:07,139 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 679 transitions. Word has length 44 [2023-11-29 05:11:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:07,140 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 679 transitions. [2023-11-29 05:11:07,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) [2023-11-29 05:11:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 679 transitions. [2023-11-29 05:11:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:11:07,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:07,146 INFO L195 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] [2023-11-29 05:11:07,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:11:07,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:07,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1051347671, now seen corresponding path program 1 times [2023-11-29 05:11:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47813801] [2023-11-29 05:11:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47813801] [2023-11-29 05:11:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47813801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:11:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395569606] [2023-11-29 05:11:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:11:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:11:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:11:07,350 INFO L87 Difference]: Start difference. First operand 477 states and 679 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2023-11-29 05:11:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:07,982 INFO L93 Difference]: Finished difference Result 982 states and 1405 transitions. [2023-11-29 05:11:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:11:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 49 [2023-11-29 05:11:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:07,989 INFO L225 Difference]: With dead ends: 982 [2023-11-29 05:11:07,989 INFO L226 Difference]: Without dead ends: 522 [2023-11-29 05:11:07,991 INFO L412 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 [2023-11-29 05:11:07,993 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 497 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:07,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 441 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:11:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-29 05:11:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 477. [2023-11-29 05:11:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 340 states have (on average 1.45) internal successors, (493), 348 states have internal predecessors, (493), 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) [2023-11-29 05:11:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 678 transitions. [2023-11-29 05:11:08,044 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 678 transitions. Word has length 49 [2023-11-29 05:11:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:08,044 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 678 transitions. [2023-11-29 05:11:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2023-11-29 05:11:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 678 transitions. [2023-11-29 05:11:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:11:08,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:08,048 INFO L195 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] [2023-11-29 05:11:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:11:08,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:08,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -223121920, now seen corresponding path program 1 times [2023-11-29 05:11:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611611241] [2023-11-29 05:11:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611611241] [2023-11-29 05:11:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611611241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:08,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:08,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:11:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016277282] [2023-11-29 05:11:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:08,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:11:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:11:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:11:08,195 INFO L87 Difference]: Start difference. First operand 477 states and 678 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:11:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:08,840 INFO L93 Difference]: Finished difference Result 527 states and 750 transitions. [2023-11-29 05:11:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:11:08,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2023-11-29 05:11:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:08,846 INFO L225 Difference]: With dead ends: 527 [2023-11-29 05:11:08,846 INFO L226 Difference]: Without dead ends: 523 [2023-11-29 05:11:08,846 INFO L412 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 [2023-11-29 05:11:08,848 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 122 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:08,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 670 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:11:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-29 05:11:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 478. [2023-11-29 05:11:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 341 states have (on average 1.4457478005865103) internal successors, (493), 349 states have internal predecessors, (493), 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) [2023-11-29 05:11:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 678 transitions. [2023-11-29 05:11:08,889 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 678 transitions. Word has length 49 [2023-11-29 05:11:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:08,890 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 678 transitions. [2023-11-29 05:11:08,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:11:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 678 transitions. [2023-11-29 05:11:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:11:08,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:08,893 INFO L195 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] [2023-11-29 05:11:08,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:11:08,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:08,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:08,894 INFO L85 PathProgramCache]: Analyzing trace with hash 347040213, now seen corresponding path program 1 times [2023-11-29 05:11:08,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:08,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691276784] [2023-11-29 05:11:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:08,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:09,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:09,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691276784] [2023-11-29 05:11:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691276784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:09,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:11:09,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168654553] [2023-11-29 05:11:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:09,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:11:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:11:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:11:09,067 INFO L87 Difference]: Start difference. First operand 478 states and 678 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:11:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:10,112 INFO L93 Difference]: Finished difference Result 1445 states and 2099 transitions. [2023-11-29 05:11:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:11:10,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-29 05:11:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:10,120 INFO L225 Difference]: With dead ends: 1445 [2023-11-29 05:11:10,121 INFO L226 Difference]: Without dead ends: 957 [2023-11-29 05:11:10,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:10,123 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 586 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:10,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 879 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:11:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2023-11-29 05:11:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 866. [2023-11-29 05:11:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 632 states have (on average 1.4699367088607596) internal successors, (929), 648 states have internal predecessors, (929), 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) [2023-11-29 05:11:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1257 transitions. [2023-11-29 05:11:10,179 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1257 transitions. Word has length 51 [2023-11-29 05:11:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:10,179 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1257 transitions. [2023-11-29 05:11:10,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:11:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1257 transitions. [2023-11-29 05:11:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 05:11:10,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:10,184 INFO L195 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] [2023-11-29 05:11:10,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:11:10,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:10,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -564276628, now seen corresponding path program 1 times [2023-11-29 05:11:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555300630] [2023-11-29 05:11:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:11:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:11:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555300630] [2023-11-29 05:11:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555300630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:10,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:11:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254388822] [2023-11-29 05:11:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:10,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:11:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:11:10,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:11:10,305 INFO L87 Difference]: Start difference. First operand 866 states and 1257 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:11:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:11,614 INFO L93 Difference]: Finished difference Result 2582 states and 3743 transitions. [2023-11-29 05:11:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2023-11-29 05:11:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:11,626 INFO L225 Difference]: With dead ends: 2582 [2023-11-29 05:11:11,627 INFO L226 Difference]: Without dead ends: 1733 [2023-11-29 05:11:11,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:11,630 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 815 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:11,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 981 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:11:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2023-11-29 05:11:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1537. [2023-11-29 05:11:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1126 states have (on average 1.4715808170515097) internal successors, (1657), 1154 states have internal predecessors, (1657), 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) [2023-11-29 05:11:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2222 transitions. [2023-11-29 05:11:11,741 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2222 transitions. Word has length 64 [2023-11-29 05:11:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:11,742 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2222 transitions. [2023-11-29 05:11:11,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:11:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2222 transitions. [2023-11-29 05:11:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 05:11:11,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:11,747 INFO L195 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] [2023-11-29 05:11:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:11:11,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:11,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1337048552, now seen corresponding path program 1 times [2023-11-29 05:11:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:11,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218919653] [2023-11-29 05:11:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:11:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 05:11:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:11,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218919653] [2023-11-29 05:11:11,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218919653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:11,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:11,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:11:11,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174038216] [2023-11-29 05:11:11,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:11,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:11:11,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:11,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:11:11,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:11:11,863 INFO L87 Difference]: Start difference. First operand 1537 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:11:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:13,128 INFO L93 Difference]: Finished difference Result 4651 states and 6715 transitions. [2023-11-29 05:11:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:13,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-29 05:11:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:13,151 INFO L225 Difference]: With dead ends: 4651 [2023-11-29 05:11:13,151 INFO L226 Difference]: Without dead ends: 3131 [2023-11-29 05:11:13,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:11:13,157 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 783 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:13,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 901 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:11:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2023-11-29 05:11:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2779. [2023-11-29 05:11:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2033 states have (on average 1.4628627643876044) internal successors, (2974), 2085 states have internal predecessors, (2974), 508 states have call successors, (508), 238 states have call predecessors, (508), 237 states have return successors, (511), 491 states have call predecessors, (511), 503 states have call successors, (511) [2023-11-29 05:11:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3993 transitions. [2023-11-29 05:11:13,440 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3993 transitions. Word has length 67 [2023-11-29 05:11:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:13,440 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 3993 transitions. [2023-11-29 05:11:13,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:11:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3993 transitions. [2023-11-29 05:11:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 05:11:13,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:13,449 INFO L195 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] [2023-11-29 05:11:13,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:11:13,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:13,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash 761972886, now seen corresponding path program 1 times [2023-11-29 05:11:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:13,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379791035] [2023-11-29 05:11:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:11:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:11:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:11:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379791035] [2023-11-29 05:11:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379791035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:13,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:13,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:11:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592119419] [2023-11-29 05:11:13,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:13,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:11:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:11:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:11:13,593 INFO L87 Difference]: Start difference. First operand 2779 states and 3993 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 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) [2023-11-29 05:11:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:14,601 INFO L93 Difference]: Finished difference Result 5875 states and 8463 transitions. [2023-11-29 05:11:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:11:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 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 71 [2023-11-29 05:11:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:14,622 INFO L225 Difference]: With dead ends: 5875 [2023-11-29 05:11:14,623 INFO L226 Difference]: Without dead ends: 3113 [2023-11-29 05:11:14,629 INFO L412 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 [2023-11-29 05:11:14,630 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 460 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:14,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 757 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:11:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2023-11-29 05:11:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2787. [2023-11-29 05:11:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2041 states have (on average 1.4610485056344928) internal successors, (2982), 2093 states have internal predecessors, (2982), 508 states have call successors, (508), 238 states have call predecessors, (508), 237 states have return successors, (511), 491 states have call predecessors, (511), 503 states have call successors, (511) [2023-11-29 05:11:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4001 transitions. [2023-11-29 05:11:14,860 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 4001 transitions. Word has length 71 [2023-11-29 05:11:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:14,861 INFO L495 AbstractCegarLoop]: Abstraction has 2787 states and 4001 transitions. [2023-11-29 05:11:14,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 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) [2023-11-29 05:11:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 4001 transitions. [2023-11-29 05:11:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 05:11:14,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:14,869 INFO L195 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] [2023-11-29 05:11:14,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:11:14,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:14,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1655459224, now seen corresponding path program 1 times [2023-11-29 05:11:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528512881] [2023-11-29 05:11:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:11:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:11:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:11:15,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:15,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528512881] [2023-11-29 05:11:15,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528512881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:15,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:15,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:11:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381731450] [2023-11-29 05:11:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:15,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:11:15,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:15,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:11:15,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:11:15,048 INFO L87 Difference]: Start difference. First operand 2787 states and 4001 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 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) [2023-11-29 05:11:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:16,062 INFO L93 Difference]: Finished difference Result 5899 states and 8487 transitions. [2023-11-29 05:11:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:11:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 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 71 [2023-11-29 05:11:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:16,078 INFO L225 Difference]: With dead ends: 5899 [2023-11-29 05:11:16,078 INFO L226 Difference]: Without dead ends: 3017 [2023-11-29 05:11:16,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:11:16,085 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 260 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:16,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1190 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:11:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2023-11-29 05:11:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2691. [2023-11-29 05:11:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 1985 states have (on average 1.4619647355163727) internal successors, (2902), 2037 states have internal predecessors, (2902), 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) [2023-11-29 05:11:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3841 transitions. [2023-11-29 05:11:16,250 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3841 transitions. Word has length 71 [2023-11-29 05:11:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:16,251 INFO L495 AbstractCegarLoop]: Abstraction has 2691 states and 3841 transitions. [2023-11-29 05:11:16,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 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) [2023-11-29 05:11:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3841 transitions. [2023-11-29 05:11:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:11:16,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:16,255 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:11:16,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:11:16,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:16,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1027149831, now seen corresponding path program 1 times [2023-11-29 05:11:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320964836] [2023-11-29 05:11:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:11:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:11:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:11:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:11:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320964836] [2023-11-29 05:11:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320964836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:16,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:11:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483141095] [2023-11-29 05:11:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:16,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:11:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:11:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:16,454 INFO L87 Difference]: Start difference. First operand 2691 states and 3841 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 3 states have internal predecessors, (76), 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) [2023-11-29 05:11:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:18,104 INFO L93 Difference]: Finished difference Result 7237 states and 10386 transitions. [2023-11-29 05:11:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:18,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 3 states have internal predecessors, (76), 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 113 [2023-11-29 05:11:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:18,128 INFO L225 Difference]: With dead ends: 7237 [2023-11-29 05:11:18,128 INFO L226 Difference]: Without dead ends: 4563 [2023-11-29 05:11:18,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:11:18,135 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 854 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:18,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1356 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:11:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2023-11-29 05:11:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 4051. [2023-11-29 05:11:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3009 states have (on average 1.4543037554004652) internal successors, (4376), 3089 states have internal predecessors, (4376), 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) [2023-11-29 05:11:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 5757 transitions. [2023-11-29 05:11:18,395 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 5757 transitions. Word has length 113 [2023-11-29 05:11:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:18,396 INFO L495 AbstractCegarLoop]: Abstraction has 4051 states and 5757 transitions. [2023-11-29 05:11:18,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 3 states have internal predecessors, (76), 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) [2023-11-29 05:11:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 5757 transitions. [2023-11-29 05:11:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 05:11:18,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:18,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-11-29 05:11:18,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:11:18,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:18,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -256732007, now seen corresponding path program 1 times [2023-11-29 05:11:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:18,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193608389] [2023-11-29 05:11:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:11:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:11:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:11:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 05:11:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:11:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:18,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193608389] [2023-11-29 05:11:18,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193608389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:18,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:18,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:11:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494552854] [2023-11-29 05:11:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:18,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:11:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:11:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:11:18,579 INFO L87 Difference]: Start difference. First operand 4051 states and 5757 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 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) [2023-11-29 05:11:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:20,115 INFO L93 Difference]: Finished difference Result 10879 states and 15550 transitions. [2023-11-29 05:11:20,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:20,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 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 116 [2023-11-29 05:11:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:20,158 INFO L225 Difference]: With dead ends: 10879 [2023-11-29 05:11:20,158 INFO L226 Difference]: Without dead ends: 6845 [2023-11-29 05:11:20,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:11:20,171 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 878 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:20,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1076 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:11:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2023-11-29 05:11:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6097. [2023-11-29 05:11:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6097 states, 4560 states have (on average 1.4464912280701754) internal successors, (6596), 4682 states have internal predecessors, (6596), 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) [2023-11-29 05:11:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6097 states to 6097 states and 8625 transitions. [2023-11-29 05:11:20,764 INFO L78 Accepts]: Start accepts. Automaton has 6097 states and 8625 transitions. Word has length 116 [2023-11-29 05:11:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:20,765 INFO L495 AbstractCegarLoop]: Abstraction has 6097 states and 8625 transitions. [2023-11-29 05:11:20,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 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) [2023-11-29 05:11:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6097 states and 8625 transitions. [2023-11-29 05:11:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 05:11:20,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:20,776 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:20,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:11:20,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:20,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash 38473004, now seen corresponding path program 1 times [2023-11-29 05:11:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264050610] [2023-11-29 05:11:20,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:20,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:11:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:11:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:11:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:11:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:11:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:21,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264050610] [2023-11-29 05:11:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264050610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082897299] [2023-11-29 05:11:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:21,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:21,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:21,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:11:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:11:21,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 05:11:21,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:11:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082897299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:21,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:11:21,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-29 05:11:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687407124] [2023-11-29 05:11:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:21,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:11:21,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:21,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:11:21,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:11:21,549 INFO L87 Difference]: Start difference. First operand 6097 states and 8625 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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) [2023-11-29 05:11:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:22,115 INFO L93 Difference]: Finished difference Result 12285 states and 17392 transitions. [2023-11-29 05:11:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:11:22,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 122 [2023-11-29 05:11:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:22,148 INFO L225 Difference]: With dead ends: 12285 [2023-11-29 05:11:22,148 INFO L226 Difference]: Without dead ends: 6043 [2023-11-29 05:11:22,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:11:22,166 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 4 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:22,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1498 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:11:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2023-11-29 05:11:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 6043. [2023-11-29 05:11:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6043 states, 4506 states have (on average 1.4438526409232135) internal successors, (6506), 4637 states have internal predecessors, (6506), 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) [2023-11-29 05:11:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6043 states to 6043 states and 8526 transitions. [2023-11-29 05:11:22,622 INFO L78 Accepts]: Start accepts. Automaton has 6043 states and 8526 transitions. Word has length 122 [2023-11-29 05:11:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:22,623 INFO L495 AbstractCegarLoop]: Abstraction has 6043 states and 8526 transitions. [2023-11-29 05:11:22,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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) [2023-11-29 05:11:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6043 states and 8526 transitions. [2023-11-29 05:11:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 05:11:22,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:22,629 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:22,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:11:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 05:11:22,830 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:22,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -653262223, now seen corresponding path program 1 times [2023-11-29 05:11:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633746329] [2023-11-29 05:11:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:11:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:11:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:11:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 05:11:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633746329] [2023-11-29 05:11:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633746329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:11:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439245956] [2023-11-29 05:11:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:11:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:11:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:23,023 INFO L87 Difference]: Start difference. First operand 6043 states and 8526 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 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) [2023-11-29 05:11:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:24,137 INFO L93 Difference]: Finished difference Result 12759 states and 18049 transitions. [2023-11-29 05:11:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:11:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 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 123 [2023-11-29 05:11:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:24,162 INFO L225 Difference]: With dead ends: 12759 [2023-11-29 05:11:24,162 INFO L226 Difference]: Without dead ends: 6733 [2023-11-29 05:11:24,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:11:24,179 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 963 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:24,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 560 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:11:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2023-11-29 05:11:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6025. [2023-11-29 05:11:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 4488 states have (on average 1.4376114081996434) internal successors, (6452), 4619 states have internal predecessors, (6452), 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) [2023-11-29 05:11:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8472 transitions. [2023-11-29 05:11:24,712 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8472 transitions. Word has length 123 [2023-11-29 05:11:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:24,712 INFO L495 AbstractCegarLoop]: Abstraction has 6025 states and 8472 transitions. [2023-11-29 05:11:24,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 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) [2023-11-29 05:11:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8472 transitions. [2023-11-29 05:11:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 05:11:24,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:24,719 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:24,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:11:24,719 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:24,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1916711326, now seen corresponding path program 1 times [2023-11-29 05:11:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374427777] [2023-11-29 05:11:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:11:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:11:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:11:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 05:11:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:11:24,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374427777] [2023-11-29 05:11:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374427777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026420559] [2023-11-29 05:11:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:24,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:24,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:24,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:11:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:11:25,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:11:25,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:11:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026420559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:25,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:11:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2023-11-29 05:11:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680235562] [2023-11-29 05:11:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:25,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:11:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:11:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:25,457 INFO L87 Difference]: Start difference. First operand 6025 states and 8472 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2023-11-29 05:11:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:26,784 INFO L93 Difference]: Finished difference Result 18017 states and 25346 transitions. [2023-11-29 05:11:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:11:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 124 [2023-11-29 05:11:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:26,875 INFO L225 Difference]: With dead ends: 18017 [2023-11-29 05:11:26,876 INFO L226 Difference]: Without dead ends: 17987 [2023-11-29 05:11:26,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:26,880 INFO L413 NwaCegarLoop]: 675 mSDtfsCounter, 727 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:26,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1314 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:11:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17987 states. [2023-11-29 05:11:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17987 to 17957. [2023-11-29 05:11:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17957 states, 13380 states have (on average 1.4389387144992527) internal successors, (19253), 13773 states have internal predecessors, (19253), 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) [2023-11-29 05:11:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17957 states to 17957 states and 25275 transitions. [2023-11-29 05:11:28,368 INFO L78 Accepts]: Start accepts. Automaton has 17957 states and 25275 transitions. Word has length 124 [2023-11-29 05:11:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:28,369 INFO L495 AbstractCegarLoop]: Abstraction has 17957 states and 25275 transitions. [2023-11-29 05:11:28,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2023-11-29 05:11:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 17957 states and 25275 transitions. [2023-11-29 05:11:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-29 05:11:28,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:28,393 INFO L195 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, 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] [2023-11-29 05:11:28,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:11:28,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:11:28,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:28,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash -332459371, now seen corresponding path program 1 times [2023-11-29 05:11:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483118958] [2023-11-29 05:11:28,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:11:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:11:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:11:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:11:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 05:11:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483118958] [2023-11-29 05:11:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483118958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:11:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855187596] [2023-11-29 05:11:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:28,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:11:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:11:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:28,900 INFO L87 Difference]: Start difference. First operand 17957 states and 25275 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 05:11:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:30,250 INFO L93 Difference]: Finished difference Result 23927 states and 33856 transitions. [2023-11-29 05:11:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2023-11-29 05:11:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:30,268 INFO L225 Difference]: With dead ends: 23927 [2023-11-29 05:11:30,268 INFO L226 Difference]: Without dead ends: 5813 [2023-11-29 05:11:30,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:11:30,307 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 547 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:30,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1401 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:11:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2023-11-29 05:11:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 5684. [2023-11-29 05:11:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5684 states, 4416 states have (on average 1.4610507246376812) internal successors, (6452), 4530 states have internal predecessors, (6452), 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) [2023-11-29 05:11:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5684 states to 5684 states and 8055 transitions. [2023-11-29 05:11:30,737 INFO L78 Accepts]: Start accepts. Automaton has 5684 states and 8055 transitions. Word has length 129 [2023-11-29 05:11:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:30,737 INFO L495 AbstractCegarLoop]: Abstraction has 5684 states and 8055 transitions. [2023-11-29 05:11:30,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 05:11:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5684 states and 8055 transitions. [2023-11-29 05:11:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 05:11:30,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:30,752 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 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] [2023-11-29 05:11:30,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:11:30,752 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:30,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1528790633, now seen corresponding path program 1 times [2023-11-29 05:11:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367788482] [2023-11-29 05:11:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 05:11:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:11:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:11:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:11:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:11:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:11:31,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:31,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367788482] [2023-11-29 05:11:31,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367788482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:31,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:11:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483454189] [2023-11-29 05:11:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:31,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:11:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:31,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:11:31,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:31,003 INFO L87 Difference]: Start difference. First operand 5684 states and 8055 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 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) [2023-11-29 05:11:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:32,367 INFO L93 Difference]: Finished difference Result 11597 states and 16477 transitions. [2023-11-29 05:11:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:11:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 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 132 [2023-11-29 05:11:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:32,383 INFO L225 Difference]: With dead ends: 11597 [2023-11-29 05:11:32,384 INFO L226 Difference]: Without dead ends: 5930 [2023-11-29 05:11:32,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:32,392 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 388 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:32,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1025 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:11:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5930 states. [2023-11-29 05:11:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5930 to 5687. [2023-11-29 05:11:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5687 states, 4419 states have (on average 1.4607377234668477) internal successors, (6455), 4533 states have internal predecessors, (6455), 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) [2023-11-29 05:11:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 8058 transitions. [2023-11-29 05:11:32,810 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 8058 transitions. Word has length 132 [2023-11-29 05:11:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:32,810 INFO L495 AbstractCegarLoop]: Abstraction has 5687 states and 8058 transitions. [2023-11-29 05:11:32,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 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) [2023-11-29 05:11:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 8058 transitions. [2023-11-29 05:11:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 05:11:32,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:32,838 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 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] [2023-11-29 05:11:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:11:32,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:32,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -314788906, now seen corresponding path program 1 times [2023-11-29 05:11:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283013575] [2023-11-29 05:11:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:11:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:11:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:11:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:11:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:11:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:11:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:11:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:11:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 05:11:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:11:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283013575] [2023-11-29 05:11:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283013575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:33,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:11:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013979320] [2023-11-29 05:11:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:11:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:11:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:33,336 INFO L87 Difference]: Start difference. First operand 5687 states and 8058 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 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) [2023-11-29 05:11:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:34,383 INFO L93 Difference]: Finished difference Result 6313 states and 8896 transitions. [2023-11-29 05:11:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:34,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 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 133 [2023-11-29 05:11:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:34,384 INFO L225 Difference]: With dead ends: 6313 [2023-11-29 05:11:34,384 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:11:34,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:11:34,392 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 550 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:34,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 438 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:11:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:11:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:11:34,393 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) [2023-11-29 05:11:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:11:34,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2023-11-29 05:11:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:34,395 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:11:34,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 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) [2023-11-29 05:11:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:11:34,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:11:34,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:11:34,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:11:34,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:13:18,037 WARN L293 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:13:24,302 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 85 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:13:30,933 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:13:37,817 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:13:44,308 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:13:50,544 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 85 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:14:43,517 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:14:49,777 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 85 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:14:56,266 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:15:02,745 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:15:09,232 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:15:15,481 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 85 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:16:04,604 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2023-11-29 05:16:04,604 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2972 2974) the Hoare annotation is: true [2023-11-29 05:16:04,604 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2081 2086) the Hoare annotation is: true [2023-11-29 05:16:04,604 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2023-11-29 05:16:04,604 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 2016 2022) the Hoare annotation is: true [2023-11-29 05:16:04,604 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2023-11-29 05:16:04,604 INFO L899 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2023-11-29 05:16:04,604 INFO L902 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2023-11-29 05:16:04,604 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2130 2163) the Hoare annotation is: true [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point L2146(lines 2142 2154) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L902 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2023-11-29 05:16:04,605 INFO L902 garLoopResultBuilder]: At program point ldv_22689(lines 2142 2154) the Hoare annotation is: true [2023-11-29 05:16:04,605 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2023-11-29 05:16:04,606 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2922 2928) the Hoare annotation is: true [2023-11-29 05:16:04,606 INFO L899 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2023-11-29 05:16:04,606 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-29 05:16:04,606 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2023-11-29 05:16:04,606 INFO L902 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2023-11-29 05:16:04,606 INFO L899 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2023-11-29 05:16:04,606 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2023-11-29 05:16:04,606 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2969 2971) the Hoare annotation is: true [2023-11-29 05:16:04,606 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L899 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L902 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2023-11-29 05:16:04,607 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2123 2129) the Hoare annotation is: true [2023-11-29 05:16:04,607 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L895 garLoopResultBuilder]: At program point L2894(line 2894) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (< 0 (+ ~nwriters_stress~0 1))) [2023-11-29 05:16:04,607 INFO L899 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L899 garLoopResultBuilder]: For program point L2892(line 2892) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L899 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L899 garLoopResultBuilder]: For program point L2892-2(line 2892) no Hoare annotation was computed. [2023-11-29 05:16:04,607 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2889 2898) the Hoare annotation is: true [2023-11-29 05:16:04,608 INFO L899 garLoopResultBuilder]: For program point L2892-4(line 2892) no Hoare annotation was computed. [2023-11-29 05:16:04,608 INFO L899 garLoopResultBuilder]: For program point L2892-6(line 2892) no Hoare annotation was computed. [2023-11-29 05:16:04,608 INFO L899 garLoopResultBuilder]: For program point L2892-7(lines 2892 2895) no Hoare annotation was computed. [2023-11-29 05:16:04,608 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2023-11-29 05:16:04,608 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-29 05:16:04,608 INFO L899 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2023-11-29 05:16:04,608 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2023-11-29 05:16:04,608 INFO L895 garLoopResultBuilder]: At program point L2865(line 2865) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,609 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2182 2188) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,609 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2009 2015) the Hoare annotation is: true [2023-11-29 05:16:04,609 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2023-11-29 05:16:04,609 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2023-11-29 05:16:04,609 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3056 3058) the Hoare annotation is: true [2023-11-29 05:16:04,609 INFO L899 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2023-11-29 05:16:04,609 INFO L899 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2023-11-29 05:16:04,609 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-29 05:16:04,609 INFO L902 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: true [2023-11-29 05:16:04,610 INFO L899 garLoopResultBuilder]: For program point L2387-1(line 2387) no Hoare annotation was computed. [2023-11-29 05:16:04,610 INFO L895 garLoopResultBuilder]: At program point L2387(line 2387) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (< 0 (+ ~nwriters_stress~0 1)))) (and (or .cse0 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) .cse1) (or .cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) .cse1))) [2023-11-29 05:16:04,610 INFO L899 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2023-11-29 05:16:04,610 INFO L899 garLoopResultBuilder]: For program point L2383-2(lines 2383 2397) no Hoare annotation was computed. [2023-11-29 05:16:04,610 INFO L899 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2023-11-29 05:16:04,610 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2371 2413) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (< 0 (+ ~nwriters_stress~0 1)))) (and (or .cse0 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) .cse1) (or .cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) .cse1))) [2023-11-29 05:16:04,610 INFO L902 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2023-11-29 05:16:04,611 INFO L902 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2023-11-29 05:16:04,611 INFO L899 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2023-11-29 05:16:04,611 INFO L899 garLoopResultBuilder]: For program point L2408-1(line 2408) no Hoare annotation was computed. [2023-11-29 05:16:04,611 INFO L899 garLoopResultBuilder]: For program point L2406-1(line 2406) no Hoare annotation was computed. [2023-11-29 05:16:04,611 INFO L902 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2023-11-29 05:16:04,611 INFO L899 garLoopResultBuilder]: For program point L2402-1(line 2402) no Hoare annotation was computed. [2023-11-29 05:16:04,611 INFO L899 garLoopResultBuilder]: For program point $Ultimate##6(lines 2390 2393) no Hoare annotation was computed. [2023-11-29 05:16:04,611 INFO L902 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2023-11-29 05:16:04,611 INFO L899 garLoopResultBuilder]: For program point L2398-1(line 2398) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L895 garLoopResultBuilder]: At program point L2394(line 2394) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (< 0 (+ ~nwriters_stress~0 1)))) (and (or .cse0 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) .cse1) (or .cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) .cse1))) [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point L2405-2(lines 2371 2413) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L902 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1956 1958) the Hoare annotation is: true [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2023-11-29 05:16:04,612 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2023-11-29 05:16:04,613 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,613 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2023-11-29 05:16:04,613 INFO L899 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:16:04,613 INFO L895 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,613 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2023-11-29 05:16:04,613 INFO L895 garLoopResultBuilder]: At program point L-1-6(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,614 INFO L895 garLoopResultBuilder]: At program point L-1-8(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,614 INFO L899 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2023-11-29 05:16:04,614 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,614 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2023-11-29 05:16:04,614 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2953 2955) the Hoare annotation is: true [2023-11-29 05:16:04,614 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2023-11-29 05:16:04,614 INFO L899 garLoopResultBuilder]: For program point L2329-1(line 2329) no Hoare annotation was computed. [2023-11-29 05:16:04,614 INFO L902 garLoopResultBuilder]: At program point L2329(line 2329) the Hoare annotation is: true [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L895 garLoopResultBuilder]: At program point L2321(line 2321) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 0 (+ ~nwriters_stress~0 1))) [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2314 2333) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 0 (+ ~nwriters_stress~0 1))) [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point $Ultimate##13(lines 2297 2300) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point L2307-2(lines 2265 2313) no Hoare annotation was computed. [2023-11-29 05:16:04,615 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L902 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2023-11-29 05:16:04,616 INFO L902 garLoopResultBuilder]: At program point L2324(line 2324) the Hoare annotation is: true [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point L2324-1(line 2324) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2929 2935) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2023-11-29 05:16:04,616 INFO L899 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L902 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2023-11-29 05:16:04,617 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2173 2181) the Hoare annotation is: true [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L902 garLoopResultBuilder]: At program point ldv_22671(lines 2096 2108) the Hoare annotation is: true [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point L2100(lines 2096 2108) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L899 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2023-11-29 05:16:04,617 INFO L902 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2023-11-29 05:16:04,618 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2087 2112) the Hoare annotation is: true [2023-11-29 05:16:04,618 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3012 3014) the Hoare annotation is: true [2023-11-29 05:16:04,618 INFO L899 garLoopResultBuilder]: For program point printkEXIT(lines 3012 3014) no Hoare annotation was computed. [2023-11-29 05:16:04,618 INFO L895 garLoopResultBuilder]: At program point L1937(line 1937) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 0 (+ ~nwriters_stress~0 1))) [2023-11-29 05:16:04,618 INFO L899 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2023-11-29 05:16:04,618 INFO L895 garLoopResultBuilder]: At program point L2874(line 2874) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 0 (+ ~nwriters_stress~0 1))) [2023-11-29 05:16:04,618 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2871 2878) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 0 (+ ~nwriters_stress~0 1))) [2023-11-29 05:16:04,618 INFO L899 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2023-11-29 05:16:04,618 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2023-11-29 05:16:04,618 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2023-11-29 05:16:04,619 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2023-11-29 05:16:04,619 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2023-11-29 05:16:04,619 INFO L899 garLoopResultBuilder]: For program point L2365-1(lines 2365 2367) no Hoare annotation was computed. [2023-11-29 05:16:04,619 INFO L902 garLoopResultBuilder]: At program point L2365(lines 2365 2367) the Hoare annotation is: true [2023-11-29 05:16:04,619 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2361 2370) the Hoare annotation is: true [2023-11-29 05:16:04,619 INFO L899 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2023-11-29 05:16:04,619 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1976 1992) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_spin~0 0)) (< ~ref_cnt~0 0) (not (= ~ldv_state_variable_2~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int#12| |old(#memory_int#12)|) (= |old(#valid)| |#valid|)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,619 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2023-11-29 05:16:04,619 INFO L902 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2023-11-29 05:16:04,619 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2023-11-29 05:16:04,620 INFO L899 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2023-11-29 05:16:04,620 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2023-11-29 05:16:04,620 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2164 2170) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,620 INFO L899 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2023-11-29 05:16:04,620 INFO L895 garLoopResultBuilder]: At program point L2857(line 2857) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (< 0 (+ ~nwriters_stress~0 1)) (not (= ~lwsa~0.offset 0))) [2023-11-29 05:16:04,620 INFO L895 garLoopResultBuilder]: At program point L2612(line 2612) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2023-11-29 05:16:04,620 INFO L899 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2023-11-29 05:16:04,620 INFO L899 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778-2(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L895 garLoopResultBuilder]: At program point L2745(line 2745) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778-1(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778-3(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778-6(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778-7(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,621 INFO L899 garLoopResultBuilder]: For program point L2778-9(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-12(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-13(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-15(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-18(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-19(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-22(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-23(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L899 garLoopResultBuilder]: For program point L2778-26(line 2778) no Hoare annotation was computed. [2023-11-29 05:16:04,622 INFO L895 garLoopResultBuilder]: At program point lock_torture_init_unwind#1(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,623 INFO L895 garLoopResultBuilder]: At program point L2614(line 2614) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2023-11-29 05:16:04,623 INFO L899 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2023-11-29 05:16:04,623 INFO L902 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2023-11-29 05:16:04,623 INFO L895 garLoopResultBuilder]: At program point L2582(line 2582) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,623 INFO L899 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2023-11-29 05:16:04,623 INFO L899 garLoopResultBuilder]: For program point L2781(lines 2624 2838) no Hoare annotation was computed. [2023-11-29 05:16:04,623 INFO L899 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2023-11-29 05:16:04,623 INFO L895 garLoopResultBuilder]: At program point L2484(line 2484) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2023-11-29 05:16:04,623 INFO L899 garLoopResultBuilder]: For program point L2484-1(line 2484) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L895 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-1(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-3(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-2(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-5(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-4(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-6(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-8(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,624 INFO L899 garLoopResultBuilder]: For program point L2683-11(line 2683) no Hoare annotation was computed. [2023-11-29 05:16:04,625 INFO L895 garLoopResultBuilder]: At program point L2750(line 2750) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2023-11-29 05:16:04,625 INFO L899 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2023-11-29 05:16:04,625 INFO L895 garLoopResultBuilder]: At program point L2486(line 2486) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2023-11-29 05:16:04,625 INFO L899 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2023-11-29 05:16:04,625 INFO L899 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2023-11-29 05:16:04,625 INFO L895 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2023-11-29 05:16:04,625 INFO L895 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2023-11-29 05:16:04,625 INFO L899 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2023-11-29 05:16:04,625 INFO L899 garLoopResultBuilder]: For program point L2686(lines 2624 2838) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L895 garLoopResultBuilder]: At program point L2554(lines 2554 2557) the Hoare annotation is: false [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2554-1(lines 2554 2557) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720-2(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720-1(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720-3(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720-6(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720-7(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2023-11-29 05:16:04,626 INFO L899 garLoopResultBuilder]: For program point L2720-9(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-12(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-13(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-15(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-18(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-19(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-22(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-23(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2720-26(line 2720) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2622(lines 2609 2844) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L899 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2023-11-29 05:16:04,627 INFO L895 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2023-11-29 05:16:04,628 INFO L895 garLoopResultBuilder]: At program point L2490(line 2490) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point L2457-1(line 2457) no Hoare annotation was computed. [2023-11-29 05:16:04,628 INFO L895 garLoopResultBuilder]: At program point L2457(line 2457) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point L2490-1(line 2490) no Hoare annotation was computed. [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2023-11-29 05:16:04,628 INFO L895 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point main_ldv_final#1(lines 2609 2844) no Hoare annotation was computed. [2023-11-29 05:16:04,628 INFO L895 garLoopResultBuilder]: At program point L2458(line 2458) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point L2458-1(line 2458) no Hoare annotation was computed. [2023-11-29 05:16:04,628 INFO L899 garLoopResultBuilder]: For program point L2723(lines 2624 2838) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-1(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-3(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-2(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-7(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-6(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-9(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-13(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,629 INFO L899 garLoopResultBuilder]: For program point L2625-12(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2625-15(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2625-19(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2625-18(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2625-23(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2625-22(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2625-26(line 2625) no Hoare annotation was computed. [2023-11-29 05:16:04,630 INFO L895 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2023-11-29 05:16:04,630 INFO L895 garLoopResultBuilder]: At program point L2726(line 2726) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2023-11-29 05:16:04,630 INFO L899 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L895 garLoopResultBuilder]: At program point L2462(line 2462) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2462-1(line 2462) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2628(lines 2624 2838) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point lock_torture_init_returnLabel#1(lines 2414 2586) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L895 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2023-11-29 05:16:04,631 INFO L895 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2023-11-29 05:16:04,631 INFO L899 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L902 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point $Ultimate##76(lines 2504 2507) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point $Ultimate##61(lines 2456 2473) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L895 garLoopResultBuilder]: At program point L2733(line 2733) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point $Ultimate##63(lines 2465 2468) no Hoare annotation was computed. [2023-11-29 05:16:04,632 INFO L895 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2023-11-29 05:16:04,632 INFO L899 garLoopResultBuilder]: For program point L2469-1(line 2469) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L895 garLoopResultBuilder]: At program point L2469(line 2469) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L899 garLoopResultBuilder]: For program point $Ultimate##59(lines 2451 2454) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L899 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L895 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2023-11-29 05:16:04,633 INFO L895 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,633 INFO L899 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L899 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L899 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2023-11-29 05:16:04,633 INFO L895 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2023-11-29 05:16:04,633 INFO L895 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L902 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2023-11-29 05:16:04,634 INFO L895 garLoopResultBuilder]: At program point L2738(line 2738) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L902 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2023-11-29 05:16:04,634 INFO L899 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L895 garLoopResultBuilder]: At program point L2475(line 2475) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point $Ultimate##105(lines 2564 2567) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L895 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2023-11-29 05:16:04,635 INFO L899 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2023-11-29 05:16:04,635 INFO L895 garLoopResultBuilder]: At program point L2610(line 2610) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2023-11-29 05:16:04,636 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2023-11-29 05:16:04,636 INFO L895 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2023-11-29 05:16:04,636 INFO L895 garLoopResultBuilder]: At program point L2544(line 2544) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0) (<= (+ ~nwriters_stress~0 1) 0)) [2023-11-29 05:16:04,636 INFO L899 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2023-11-29 05:16:04,636 INFO L899 garLoopResultBuilder]: For program point L2544-1(line 2544) no Hoare annotation was computed. [2023-11-29 05:16:04,636 INFO L899 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2023-11-29 05:16:04,636 INFO L899 garLoopResultBuilder]: For program point L2478-1(lines 2478 2483) no Hoare annotation was computed. [2023-11-29 05:16:04,636 INFO L902 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2023-11-29 05:16:04,639 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:04,641 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:16:04,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:16:04 BoogieIcfgContainer [2023-11-29 05:16:04,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:16:04,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:16:04,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:16:04,654 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:16:04,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:11:05" (3/4) ... [2023-11-29 05:16:04,656 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-29 05:16:04,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2023-11-29 05:16:04,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-29 05:16:04,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2023-11-29 05:16:04,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2023-11-29 05:16:04,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2023-11-29 05:16:04,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2023-11-29 05:16:04,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2023-11-29 05:16:04,662 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2023-11-29 05:16:04,684 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2023-11-29 05:16:04,686 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2023-11-29 05:16:04,689 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 05:16:04,691 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-29 05:16:04,693 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:16:04,696 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:16:04,698 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:16:04,881 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:16:04,881 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:16:04,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:16:04,882 INFO L158 Benchmark]: Toolchain (without parser) took 301857.99ms. Allocated memory was 140.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 105.8MB in the beginning and 568.7MB in the end (delta: -462.9MB). Peak memory consumption was 873.3MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,882 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:16:04,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 826.56ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 105.8MB in the beginning and 143.7MB in the end (delta: -37.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.45ms. Allocated memory is still 188.7MB. Free memory was 143.7MB in the beginning and 137.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,883 INFO L158 Benchmark]: Boogie Preprocessor took 126.79ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 126.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,884 INFO L158 Benchmark]: RCFGBuilder took 1230.60ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 125.1MB in the end (delta: 738.5kB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,884 INFO L158 Benchmark]: TraceAbstraction took 299356.28ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 124.0MB in the beginning and 588.6MB in the end (delta: -464.6MB). Peak memory consumption was 990.9MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,885 INFO L158 Benchmark]: Witness Printer took 227.24ms. Allocated memory is still 1.5GB. Free memory was 588.6MB in the beginning and 568.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:16:04,887 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 826.56ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 105.8MB in the beginning and 143.7MB in the end (delta: -37.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.45ms. Allocated memory is still 188.7MB. Free memory was 143.7MB in the beginning and 137.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.79ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 126.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.60ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 125.1MB in the end (delta: 738.5kB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 299356.28ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 124.0MB in the beginning and 588.6MB in the end (delta: -464.6MB). Peak memory consumption was 990.9MB. Max. memory is 16.1GB. * Witness Printer took 227.24ms. Allocated memory is still 1.5GB. Free memory was 588.6MB in the beginning and 568.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 1855]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] - GenericResultAtLocation [Line: 1858]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] - GenericResultAtLocation [Line: 1861]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] - GenericResultAtLocation [Line: 1864]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] - GenericResultAtLocation [Line: 1902]: 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2013]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 319 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 299.3s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 270.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9496 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9027 mSDsluCounter, 15110 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10417 mSDsCounter, 4230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10380 IncrementalHoareTripleChecker+Invalid, 14610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4230 mSolverCounterUnsat, 4693 mSDtfsCounter, 10380 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17957occurred in iteration=13, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3799 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 18930 PreInvPairs, 19705 NumberOfFragments, 1290 HoareAnnotationTreeSize, 18930 FomulaSimplifications, 14468388 FormulaSimplificationTreeSizeReduction, 267.5s HoareSimplificationTime, 98 FomulaSimplificationsInter, 24320 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1704 NumberOfCodeBlocks, 1704 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1686 ConstructedInterpolants, 0 QuantifiedInterpolants, 3166 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2005 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 485/511 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2016]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: (((((ldv_state_variable_0 == 1) && (ldv_spin == 0)) && (tmp___0 == 0)) && ((firsterr + 12) <= 0)) && ((nwriters_stress + 1) <= 0)) - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-29 05:16:04,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd0b6e5b-b437-4579-b256-a4138ea90a3e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE