./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.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_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/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_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/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_7449ed7c-4297-4801-ba57-64033efa8042/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 e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:47:29,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:47:29,270 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 06:47:29,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:47:29,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:47:29,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:47:29,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:47:29,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:47:29,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:47:29,301 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:47:29,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:47:29,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:47:29,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:47:29,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:47:29,304 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:47:29,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:47:29,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:47:29,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:47:29,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:47:29,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:47:29,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:47:29,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:47:29,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:47:29,310 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:47:29,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:47:29,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:47:29,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:47:29,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:47:29,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:47:29,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:47:29,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:47:29,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:47:29,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:47:29,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:47:29,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:47:29,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:47:29,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:47:29,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:47:29,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:47:29,331 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_7449ed7c-4297-4801-ba57-64033efa8042/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_7449ed7c-4297-4801-ba57-64033efa8042/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 -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2023-11-29 06:47:29,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:47:29,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:47:29,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:47:29,558 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:47:29,559 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:47:29,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-29 06:47:32,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:47:32,608 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:47:32,608 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-29 06:47:32,630 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/data/404ce2b37/36cf5864d38f4aee8aaa028a3dfdb7fc/FLAGd4f8d57c8 [2023-11-29 06:47:32,643 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/data/404ce2b37/36cf5864d38f4aee8aaa028a3dfdb7fc [2023-11-29 06:47:32,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:47:32,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:47:32,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:47:32,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:47:32,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:47:32,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:47:32" (1/1) ... [2023-11-29 06:47:32,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ef58aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:32, skipping insertion in model container [2023-11-29 06:47:32,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:47:32" (1/1) ... [2023-11-29 06:47:32,717 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:47:33,185 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_7449ed7c-4297-4801-ba57-64033efa8042/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-29 06:47:33,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:47:33,225 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:47:33,353 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_7449ed7c-4297-4801-ba57-64033efa8042/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-29 06:47:33,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:47:33,388 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:47:33,388 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:47:33,394 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:47:33,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33 WrapperNode [2023-11-29 06:47:33,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:47:33,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:47:33,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:47:33,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:47:33,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,544 INFO L138 Inliner]: procedures = 102, calls = 434, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1164 [2023-11-29 06:47:33,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:47:33,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:47:33,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:47:33,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:47:33,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,720 INFO L175 MemorySlicer]: Split 235 memory accesses to 15 slices as follows [2, 4, 7, 155, 4, 5, 6, 10, 8, 3, 3, 2, 18, 4, 4]. 66 percent of accesses are in the largest equivalence class. The 84 initializations are split as follows [2, 4, 7, 42, 4, 5, 6, 0, 0, 3, 3, 2, 0, 3, 3]. The 46 writes are split as follows [0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0]. [2023-11-29 06:47:33,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:47:33,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:47:33,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:47:33,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:47:33,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (1/1) ... [2023-11-29 06:47:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:47:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:47:33,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:47:33,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:47:33,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 06:47:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 06:47:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 06:47:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-29 06:47:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-29 06:47:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-29 06:47:33,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-29 06:47:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-29 06:47:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-29 06:47:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2023-11-29 06:47:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2023-11-29 06:47:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2023-11-29 06:47:33,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2023-11-29 06:47:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2023-11-29 06:47:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2023-11-29 06:47:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-29 06:47:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-29 06:47:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-29 06:47:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2023-11-29 06:47:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 06:47:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-29 06:47:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:47:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 06:47:33,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 06:47:33,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 06:47:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 06:47:33,894 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 06:47:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:47:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:47:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:47:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:47:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 06:47:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 06:47:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-29 06:47:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-29 06:47:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-29 06:47:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 06:47:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 06:47:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2023-11-29 06:47:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2023-11-29 06:47:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2023-11-29 06:47:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:47:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 06:47:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2023-11-29 06:47:33,899 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-29 06:47:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2023-11-29 06:47:33,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 06:47:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 06:47:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 06:47:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-29 06:47:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-29 06:47:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-29 06:47:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-29 06:47:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2023-11-29 06:47:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2023-11-29 06:47:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-29 06:47:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 06:47:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-29 06:47:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-29 06:47:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-29 06:47:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-29 06:47:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-29 06:47:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-29 06:47:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-29 06:47:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-29 06:47:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-29 06:47:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-29 06:47:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 06:47:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 06:47:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 06:47:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 06:47:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 06:47:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 06:47:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 06:47:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 06:47:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 06:47:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-29 06:47:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-29 06:47:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-29 06:47:33,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-29 06:47:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2023-11-29 06:47:33,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-29 06:47:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2023-11-29 06:47:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-29 06:47:33,911 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-29 06:47:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:47:33,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:47:34,272 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:47:34,275 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:47:35,222 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:47:35,344 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:47:35,344 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:47:35,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:47:35 BoogieIcfgContainer [2023-11-29 06:47:35,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:47:35,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:47:35,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:47:35,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:47:35,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:47:32" (1/3) ... [2023-11-29 06:47:35,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf3a0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:47:35, skipping insertion in model container [2023-11-29 06:47:35,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:47:33" (2/3) ... [2023-11-29 06:47:35,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf3a0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:47:35, skipping insertion in model container [2023-11-29 06:47:35,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:47:35" (3/3) ... [2023-11-29 06:47:35,353 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-29 06:47:35,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:47:35,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:47:35,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:47:35,459 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;@74754f25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:47:35,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:47:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 165 states have (on average 1.4) internal successors, (231), 170 states have internal predecessors, (231), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 06:47:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 06:47:35,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:35,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-29 06:47:35,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:35,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1376610380, now seen corresponding path program 1 times [2023-11-29 06:47:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290588175] [2023-11-29 06:47:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:47:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:47:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:47:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 06:47:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 06:47:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290588175] [2023-11-29 06:47:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290588175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764242615] [2023-11-29 06:47:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:36,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:36,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:36,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:36,200 INFO L87 Difference]: Start difference. First operand has 239 states, 165 states have (on average 1.4) internal successors, (231), 170 states have internal predecessors, (231), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 06:47:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:38,445 INFO L93 Difference]: Finished difference Result 552 states and 806 transitions. [2023-11-29 06:47:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:47:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2023-11-29 06:47:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:38,460 INFO L225 Difference]: With dead ends: 552 [2023-11-29 06:47:38,460 INFO L226 Difference]: Without dead ends: 303 [2023-11-29 06:47:38,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:47:38,470 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 197 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:38,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 993 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 06:47:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-29 06:47:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 233. [2023-11-29 06:47:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 166 states have internal predecessors, (223), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:47:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2023-11-29 06:47:38,539 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 99 [2023-11-29 06:47:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:38,540 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2023-11-29 06:47:38,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 06:47:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2023-11-29 06:47:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:47:38,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:38,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:38,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:47:38,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:38,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1901770316, now seen corresponding path program 1 times [2023-11-29 06:47:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029162709] [2023-11-29 06:47:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029162709] [2023-11-29 06:47:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029162709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:38,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:47:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642498108] [2023-11-29 06:47:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:38,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:47:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:47:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:47:38,913 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:40,078 INFO L93 Difference]: Finished difference Result 486 states and 684 transitions. [2023-11-29 06:47:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:47:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-29 06:47:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:40,082 INFO L225 Difference]: With dead ends: 486 [2023-11-29 06:47:40,083 INFO L226 Difference]: Without dead ends: 257 [2023-11-29 06:47:40,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:40,086 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:40,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 608 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 06:47:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-29 06:47:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2023-11-29 06:47:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 167 states have internal predecessors, (224), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:47:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2023-11-29 06:47:40,112 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 105 [2023-11-29 06:47:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:40,113 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2023-11-29 06:47:40,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2023-11-29 06:47:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:47:40,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:40,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:40,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:47:40,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:40,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1956163214, now seen corresponding path program 1 times [2023-11-29 06:47:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417265357] [2023-11-29 06:47:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417265357] [2023-11-29 06:47:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417265357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:40,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672202577] [2023-11-29 06:47:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:40,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:40,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:40,467 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:42,315 INFO L93 Difference]: Finished difference Result 561 states and 802 transitions. [2023-11-29 06:47:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:47:42,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-29 06:47:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:42,320 INFO L225 Difference]: With dead ends: 561 [2023-11-29 06:47:42,320 INFO L226 Difference]: Without dead ends: 331 [2023-11-29 06:47:42,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:47:42,322 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 207 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:42,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1034 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 06:47:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-29 06:47:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2023-11-29 06:47:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 166 states have (on average 1.3614457831325302) internal successors, (226), 169 states have internal predecessors, (226), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:47:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2023-11-29 06:47:42,347 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 105 [2023-11-29 06:47:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:42,347 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2023-11-29 06:47:42,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2023-11-29 06:47:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:47:42,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:42,351 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:42,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:47:42,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:42,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash -32935180, now seen corresponding path program 1 times [2023-11-29 06:47:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704899709] [2023-11-29 06:47:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704899709] [2023-11-29 06:47:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704899709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:47:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806564856] [2023-11-29 06:47:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:42,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:47:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:47:42,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:47:42,606 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:43,753 INFO L93 Difference]: Finished difference Result 492 states and 690 transitions. [2023-11-29 06:47:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:47:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-29 06:47:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:43,756 INFO L225 Difference]: With dead ends: 492 [2023-11-29 06:47:43,757 INFO L226 Difference]: Without dead ends: 260 [2023-11-29 06:47:43,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:43,759 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 138 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:43,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 609 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 06:47:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-29 06:47:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2023-11-29 06:47:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 170 states have internal predecessors, (227), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:47:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 329 transitions. [2023-11-29 06:47:43,776 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 329 transitions. Word has length 105 [2023-11-29 06:47:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:43,777 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 329 transitions. [2023-11-29 06:47:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 329 transitions. [2023-11-29 06:47:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:47:43,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:43,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:43,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:47:43,780 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:43,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash -542408270, now seen corresponding path program 1 times [2023-11-29 06:47:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:43,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507774259] [2023-11-29 06:47:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507774259] [2023-11-29 06:47:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507774259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524788085] [2023-11-29 06:47:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:44,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:44,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:44,347 INFO L87 Difference]: Start difference. First operand 237 states and 329 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:46,763 INFO L93 Difference]: Finished difference Result 766 states and 1085 transitions. [2023-11-29 06:47:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:47:46,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-29 06:47:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:46,770 INFO L225 Difference]: With dead ends: 766 [2023-11-29 06:47:46,770 INFO L226 Difference]: Without dead ends: 762 [2023-11-29 06:47:46,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:47:46,772 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 945 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:46,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 792 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 06:47:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-29 06:47:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 693. [2023-11-29 06:47:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 491 states have (on average 1.3584521384928716) internal successors, (667), 498 states have internal predecessors, (667), 150 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (152), 148 states have call predecessors, (152), 148 states have call successors, (152) [2023-11-29 06:47:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 969 transitions. [2023-11-29 06:47:46,831 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 969 transitions. Word has length 105 [2023-11-29 06:47:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:46,832 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 969 transitions. [2023-11-29 06:47:46,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 06:47:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 969 transitions. [2023-11-29 06:47:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 06:47:46,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:46,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:47:46,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:46,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash -594832168, now seen corresponding path program 1 times [2023-11-29 06:47:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069267087] [2023-11-29 06:47:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:47:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:47,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069267087] [2023-11-29 06:47:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069267087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:47:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894716475] [2023-11-29 06:47:47,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:47,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:47:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:47:47,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:47:47,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:47:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:47,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:47:47,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:47:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:47:47,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:47:47,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894716475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:47,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:47:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 06:47:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870455630] [2023-11-29 06:47:47,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:47,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:47:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:47,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:47:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:47:47,820 INFO L87 Difference]: Start difference. First operand 693 states and 969 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 06:47:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:48,452 INFO L93 Difference]: Finished difference Result 1384 states and 1937 transitions. [2023-11-29 06:47:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:47:48,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2023-11-29 06:47:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:48,461 INFO L225 Difference]: With dead ends: 1384 [2023-11-29 06:47:48,461 INFO L226 Difference]: Without dead ends: 1151 [2023-11-29 06:47:48,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:47:48,463 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 311 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:48,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 804 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:47:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-11-29 06:47:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 921. [2023-11-29 06:47:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 653 states have (on average 1.356814701378254) internal successors, (886), 662 states have internal predecessors, (886), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-29 06:47:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1286 transitions. [2023-11-29 06:47:48,539 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1286 transitions. Word has length 113 [2023-11-29 06:47:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:48,540 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1286 transitions. [2023-11-29 06:47:48,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 06:47:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1286 transitions. [2023-11-29 06:47:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 06:47:48,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:48,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:48,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:47:48,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 06:47:48,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:48,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash -584614501, now seen corresponding path program 1 times [2023-11-29 06:47:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:48,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24053764] [2023-11-29 06:47:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:47:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:47:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:47:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 06:47:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24053764] [2023-11-29 06:47:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24053764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307828190] [2023-11-29 06:47:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:49,138 INFO L87 Difference]: Start difference. First operand 921 states and 1286 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:51,202 INFO L93 Difference]: Finished difference Result 2430 states and 3513 transitions. [2023-11-29 06:47:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:47:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-29 06:47:51,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:51,211 INFO L225 Difference]: With dead ends: 2430 [2023-11-29 06:47:51,211 INFO L226 Difference]: Without dead ends: 1513 [2023-11-29 06:47:51,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:47:51,215 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 256 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:51,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1224 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 06:47:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-29 06:47:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 929. [2023-11-29 06:47:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 661 states have (on average 1.3524962178517397) internal successors, (894), 670 states have internal predecessors, (894), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-29 06:47:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1294 transitions. [2023-11-29 06:47:51,282 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1294 transitions. Word has length 150 [2023-11-29 06:47:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:51,282 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1294 transitions. [2023-11-29 06:47:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1294 transitions. [2023-11-29 06:47:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 06:47:51,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:51,285 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:51,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:47:51,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:51,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1864985629, now seen corresponding path program 1 times [2023-11-29 06:47:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:51,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808877466] [2023-11-29 06:47:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:47:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:47:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:47:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 06:47:51,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:51,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808877466] [2023-11-29 06:47:51,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808877466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:51,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:47:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556793739] [2023-11-29 06:47:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:51,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:47:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:47:51,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:47:51,547 INFO L87 Difference]: Start difference. First operand 929 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:52,660 INFO L93 Difference]: Finished difference Result 1950 states and 2739 transitions. [2023-11-29 06:47:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:47:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-29 06:47:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:52,667 INFO L225 Difference]: With dead ends: 1950 [2023-11-29 06:47:52,667 INFO L226 Difference]: Without dead ends: 1025 [2023-11-29 06:47:52,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:52,670 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:52,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 608 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 06:47:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-29 06:47:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 933. [2023-11-29 06:47:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 665 states have (on average 1.350375939849624) internal successors, (898), 674 states have internal predecessors, (898), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-29 06:47:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1298 transitions. [2023-11-29 06:47:52,719 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1298 transitions. Word has length 150 [2023-11-29 06:47:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:52,719 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1298 transitions. [2023-11-29 06:47:52,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1298 transitions. [2023-11-29 06:47:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 06:47:52,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:52,721 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:52,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:47:52,722 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:52,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 493178331, now seen corresponding path program 1 times [2023-11-29 06:47:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743098599] [2023-11-29 06:47:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:47:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:47:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:47:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 06:47:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743098599] [2023-11-29 06:47:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743098599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:53,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:53,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204922972] [2023-11-29 06:47:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:53,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:53,074 INFO L87 Difference]: Start difference. First operand 933 states and 1298 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:55,395 INFO L93 Difference]: Finished difference Result 2906 states and 4247 transitions. [2023-11-29 06:47:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:47:55,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-29 06:47:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:55,408 INFO L225 Difference]: With dead ends: 2906 [2023-11-29 06:47:55,408 INFO L226 Difference]: Without dead ends: 1977 [2023-11-29 06:47:55,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:47:55,411 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 405 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:55,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1424 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 06:47:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-29 06:47:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 941. [2023-11-29 06:47:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 673 states have (on average 1.3462109955423478) internal successors, (906), 682 states have internal predecessors, (906), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-29 06:47:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1306 transitions. [2023-11-29 06:47:55,554 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1306 transitions. Word has length 150 [2023-11-29 06:47:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:55,555 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1306 transitions. [2023-11-29 06:47:55,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1306 transitions. [2023-11-29 06:47:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 06:47:55,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:55,559 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:55,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:47:55,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:55,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:55,560 INFO L85 PathProgramCache]: Analyzing trace with hash 79029050, now seen corresponding path program 1 times [2023-11-29 06:47:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:55,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345280289] [2023-11-29 06:47:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:47:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:47:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 06:47:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 06:47:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345280289] [2023-11-29 06:47:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345280289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:55,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111748805] [2023-11-29 06:47:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:55,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:55,963 INFO L87 Difference]: Start difference. First operand 941 states and 1306 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:58,653 INFO L93 Difference]: Finished difference Result 3090 states and 4533 transitions. [2023-11-29 06:47:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:47:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-11-29 06:47:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:58,669 INFO L225 Difference]: With dead ends: 3090 [2023-11-29 06:47:58,669 INFO L226 Difference]: Without dead ends: 2153 [2023-11-29 06:47:58,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:47:58,673 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 477 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:58,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1532 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 06:47:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2023-11-29 06:47:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 949. [2023-11-29 06:47:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.342143906020558) internal successors, (914), 690 states have internal predecessors, (914), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-29 06:47:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1314 transitions. [2023-11-29 06:47:58,784 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1314 transitions. Word has length 151 [2023-11-29 06:47:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:58,785 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1314 transitions. [2023-11-29 06:47:58,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:47:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1314 transitions. [2023-11-29 06:47:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 06:47:58,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:58,788 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:47:58,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:47:58,789 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:58,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash 258983410, now seen corresponding path program 1 times [2023-11-29 06:47:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495336398] [2023-11-29 06:47:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:58,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:47:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:47:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:47:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:47:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:47:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:47:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:47:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:47:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:47:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:47:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:47:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:47:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:47:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:47:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 06:47:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:47:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 06:47:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:47:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495336398] [2023-11-29 06:47:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495336398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:47:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:47:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:47:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887019898] [2023-11-29 06:47:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:47:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:47:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:47:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:47:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:47:59,213 INFO L87 Difference]: Start difference. First operand 949 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:48:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:00,652 INFO L93 Difference]: Finished difference Result 2278 states and 3223 transitions. [2023-11-29 06:48:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:48:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-11-29 06:48:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:00,659 INFO L225 Difference]: With dead ends: 2278 [2023-11-29 06:48:00,659 INFO L226 Difference]: Without dead ends: 1333 [2023-11-29 06:48:00,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:48:00,661 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 227 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:00,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 999 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 06:48:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-29 06:48:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1012. [2023-11-29 06:48:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 736 states have (on average 1.346467391304348) internal successors, (991), 745 states have internal predecessors, (991), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2023-11-29 06:48:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1407 transitions. [2023-11-29 06:48:00,722 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1407 transitions. Word has length 151 [2023-11-29 06:48:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:00,723 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1407 transitions. [2023-11-29 06:48:00,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 06:48:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1407 transitions. [2023-11-29 06:48:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 06:48:00,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:48:00,727 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:48:00,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:48:00,727 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:48:00,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:48:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1845204848, now seen corresponding path program 1 times [2023-11-29 06:48:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:48:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534963307] [2023-11-29 06:48:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:48:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:00,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:48:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:48:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:48:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:48:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:48:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:48:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:48:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:48:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:48:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:48:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:48:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:48:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:48:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:48:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 06:48:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:48:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534963307] [2023-11-29 06:48:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534963307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:48:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752337625] [2023-11-29 06:48:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:01,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:48:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:48:01,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:48:01,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:48:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:01,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:48:01,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:48:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 06:48:01,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:48:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 06:48:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752337625] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:48:01,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:48:01,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-29 06:48:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267704554] [2023-11-29 06:48:01,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:48:01,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:48:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:48:01,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:48:01,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:48:01,922 INFO L87 Difference]: Start difference. First operand 1012 states and 1407 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 06:48:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:03,387 INFO L93 Difference]: Finished difference Result 2538 states and 3631 transitions. [2023-11-29 06:48:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:48:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2023-11-29 06:48:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:03,397 INFO L225 Difference]: With dead ends: 2538 [2023-11-29 06:48:03,398 INFO L226 Difference]: Without dead ends: 1530 [2023-11-29 06:48:03,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:48:03,401 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 208 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:03,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1000 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 06:48:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2023-11-29 06:48:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1316. [2023-11-29 06:48:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 992 states have (on average 1.3538306451612903) internal successors, (1343), 1001 states have internal predecessors, (1343), 255 states have call successors, (255), 69 states have call predecessors, (255), 68 states have return successors, (257), 253 states have call predecessors, (257), 253 states have call successors, (257) [2023-11-29 06:48:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1855 transitions. [2023-11-29 06:48:03,506 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1855 transitions. Word has length 152 [2023-11-29 06:48:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:03,506 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1855 transitions. [2023-11-29 06:48:03,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 06:48:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1855 transitions. [2023-11-29 06:48:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 06:48:03,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:48:03,511 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:48:03,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:48:03,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:48:03,712 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:48:03,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:48:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -831682783, now seen corresponding path program 1 times [2023-11-29 06:48:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:48:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437562824] [2023-11-29 06:48:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:48:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:48:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:48:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:48:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:48:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:48:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:48:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:48:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:48:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:48:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:48:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:48:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:48:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:48:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:48:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 06:48:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 06:48:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:48:04,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437562824] [2023-11-29 06:48:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437562824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:48:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:48:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:48:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327080445] [2023-11-29 06:48:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:48:04,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:48:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:48:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:48:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:48:04,081 INFO L87 Difference]: Start difference. First operand 1316 states and 1855 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:48:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:05,870 INFO L93 Difference]: Finished difference Result 2063 states and 2947 transitions. [2023-11-29 06:48:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:48:05,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2023-11-29 06:48:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:05,876 INFO L225 Difference]: With dead ends: 2063 [2023-11-29 06:48:05,876 INFO L226 Difference]: Without dead ends: 1057 [2023-11-29 06:48:05,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:48:05,878 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 396 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:05,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1032 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:48:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-11-29 06:48:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 983. [2023-11-29 06:48:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 739 states have (on average 1.3355886332882274) internal successors, (987), 746 states have internal predecessors, (987), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-29 06:48:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1371 transitions. [2023-11-29 06:48:05,955 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1371 transitions. Word has length 160 [2023-11-29 06:48:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:05,956 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1371 transitions. [2023-11-29 06:48:05,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:48:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1371 transitions. [2023-11-29 06:48:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-29 06:48:05,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:48:05,961 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:48:05,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:48:05,961 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:48:05,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:48:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash -611749994, now seen corresponding path program 1 times [2023-11-29 06:48:05,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:48:05,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508623792] [2023-11-29 06:48:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:48:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:48:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:48:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:48:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:48:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:48:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:48:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:48:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:48:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:48:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:48:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:48:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:48:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:48:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:48:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:48:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 06:48:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-29 06:48:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:48:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508623792] [2023-11-29 06:48:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508623792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:48:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:48:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:48:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210801849] [2023-11-29 06:48:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:48:06,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:48:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:48:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:48:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:48:06,289 INFO L87 Difference]: Start difference. First operand 983 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:48:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:08,259 INFO L93 Difference]: Finished difference Result 2634 states and 3786 transitions. [2023-11-29 06:48:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:48:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 180 [2023-11-29 06:48:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:08,268 INFO L225 Difference]: With dead ends: 2634 [2023-11-29 06:48:08,268 INFO L226 Difference]: Without dead ends: 1655 [2023-11-29 06:48:08,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:48:08,270 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 304 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:08,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1312 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 06:48:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2023-11-29 06:48:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 989. [2023-11-29 06:48:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 745 states have (on average 1.3328859060402685) internal successors, (993), 752 states have internal predecessors, (993), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-29 06:48:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1377 transitions. [2023-11-29 06:48:08,329 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1377 transitions. Word has length 180 [2023-11-29 06:48:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:08,329 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1377 transitions. [2023-11-29 06:48:08,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:48:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1377 transitions. [2023-11-29 06:48:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 06:48:08,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:48:08,333 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:48:08,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:48:08,333 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:48:08,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:48:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1212147252, now seen corresponding path program 1 times [2023-11-29 06:48:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:48:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008559286] [2023-11-29 06:48:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:48:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:48:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:48:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:48:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:48:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:48:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:48:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:48:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:48:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:48:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:48:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:48:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:48:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:48:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:48:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 06:48:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 06:48:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-29 06:48:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:48:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008559286] [2023-11-29 06:48:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008559286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:48:08,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:48:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:48:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698056497] [2023-11-29 06:48:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:48:08,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:48:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:48:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:48:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:48:08,712 INFO L87 Difference]: Start difference. First operand 989 states and 1377 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 06:48:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:10,060 INFO L93 Difference]: Finished difference Result 1899 states and 2651 transitions. [2023-11-29 06:48:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:48:10,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 190 [2023-11-29 06:48:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:10,066 INFO L225 Difference]: With dead ends: 1899 [2023-11-29 06:48:10,066 INFO L226 Difference]: Without dead ends: 914 [2023-11-29 06:48:10,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:48:10,070 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 469 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:10,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 609 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 06:48:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-29 06:48:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 843. [2023-11-29 06:48:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 619 states have (on average 1.310177705977383) internal successors, (811), 626 states have internal predecessors, (811), 172 states have call successors, (172), 52 states have call predecessors, (172), 51 states have return successors, (172), 170 states have call predecessors, (172), 170 states have call successors, (172) [2023-11-29 06:48:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1155 transitions. [2023-11-29 06:48:10,147 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1155 transitions. Word has length 190 [2023-11-29 06:48:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:10,147 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1155 transitions. [2023-11-29 06:48:10,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 06:48:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1155 transitions. [2023-11-29 06:48:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 06:48:10,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:48:10,152 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:48:10,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:48:10,152 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:48:10,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:48:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 836152208, now seen corresponding path program 2 times [2023-11-29 06:48:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:48:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713408007] [2023-11-29 06:48:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:48:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:48:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:48:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 06:48:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 06:48:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 06:48:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:48:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:48:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:48:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 06:48:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:48:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 06:48:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:48:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 06:48:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:48:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:48:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 06:48:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 06:48:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:48:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-29 06:48:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:48:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713408007] [2023-11-29 06:48:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713408007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:48:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:48:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:48:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196465102] [2023-11-29 06:48:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:48:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:48:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:48:10,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:48:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:48:10,878 INFO L87 Difference]: Start difference. First operand 843 states and 1155 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 06:48:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:12,590 INFO L93 Difference]: Finished difference Result 1214 states and 1697 transitions. [2023-11-29 06:48:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:48:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 190 [2023-11-29 06:48:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:12,591 INFO L225 Difference]: With dead ends: 1214 [2023-11-29 06:48:12,591 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:48:12,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:48:12,594 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 968 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:12,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 621 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 06:48:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:48:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:48:12,595 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 06:48:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:48:12,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2023-11-29 06:48:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:12,596 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:48:12,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 06:48:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:48:12,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:48:12,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:48:12,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:48:12,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:48:47,381 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2023-11-29 06:48:47,381 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2023-11-29 06:48:47,381 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2023-11-29 06:48:47,381 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1634 1643) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-29 06:48:47,382 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2023-11-29 06:48:47,382 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2023-11-29 06:48:47,382 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2023-11-29 06:48:47,382 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2023-11-29 06:48:47,382 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2023-11-29 06:48:47,382 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse3 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse1 (= |old(#valid)| |#valid|))) (and (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse0 .cse3 .cse1) (or .cse2 .cse3 .cse1 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-29 06:48:47,382 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2412 2417) the Hoare annotation is: true [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point L1567-2(line 1567) no Hoare annotation was computed. [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point L1567-4(line 1567) no Hoare annotation was computed. [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2023-11-29 06:48:47,383 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1676 1683) the Hoare annotation is: true [2023-11-29 06:48:47,383 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2553 2555) the Hoare annotation is: true [2023-11-29 06:48:47,383 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2023-11-29 06:48:47,384 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2023-11-29 06:48:47,384 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2590 2592) the Hoare annotation is: true [2023-11-29 06:48:47,384 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2023-11-29 06:48:47,384 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2023-11-29 06:48:47,384 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-29 06:48:47,384 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2023-11-29 06:48:47,384 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2023-11-29 06:48:47,384 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2023-11-29 06:48:47,384 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2023-11-29 06:48:47,384 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2023-11-29 06:48:47,385 INFO L899 garLoopResultBuilder]: For program point L2224(lines 2201 2236) no Hoare annotation was computed. [2023-11-29 06:48:47,385 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-29 06:48:47,385 INFO L899 garLoopResultBuilder]: For program point L2216(lines 2201 2236) no Hoare annotation was computed. [2023-11-29 06:48:47,385 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2023-11-29 06:48:47,385 INFO L899 garLoopResultBuilder]: For program point $Ultimate##4(lines 2219 2222) no Hoare annotation was computed. [2023-11-29 06:48:47,385 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2023-11-29 06:48:47,385 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2023-11-29 06:48:47,385 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-29 06:48:47,385 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2023-11-29 06:48:47,386 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2023-11-29 06:48:47,386 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2023-11-29 06:48:47,386 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2023-11-29 06:48:47,386 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2424 2429) the Hoare annotation is: true [2023-11-29 06:48:47,387 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2023-11-29 06:48:47,387 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2023-11-29 06:48:47,387 INFO L895 garLoopResultBuilder]: At program point L1716(line 1716) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_int#3| |old(#memory_int#3)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1 .cse3) (or .cse0 .cse1 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse1 .cse3 .cse2))) [2023-11-29 06:48:47,387 INFO L899 garLoopResultBuilder]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2023-11-29 06:48:47,387 INFO L902 garLoopResultBuilder]: At program point L1713(line 1713) the Hoare annotation is: true [2023-11-29 06:48:47,387 INFO L899 garLoopResultBuilder]: For program point L1713-1(line 1713) no Hoare annotation was computed. [2023-11-29 06:48:47,387 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2023-11-29 06:48:47,388 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1695 1719) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_int#3| |old(#memory_int#3)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1 .cse3) (or .cse0 .cse1 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse1 .cse3 .cse2))) [2023-11-29 06:48:47,388 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2023-11-29 06:48:47,388 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2023-11-29 06:48:47,388 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2536 2538) the Hoare annotation is: true [2023-11-29 06:48:47,388 INFO L895 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse1 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse1) (or .cse2 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse0))) [2023-11-29 06:48:47,388 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse2) (or .cse3 .cse0 .cse2) (or (< ~ldv_count_1~0 (+ 2 |old(~ldv_count_2~0)|)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse1 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6) (= ~ldv_count_2~0 0)))) [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2545 2547) the Hoare annotation is: true [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 2530 2532) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2530 2532) the Hoare annotation is: true [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-29 06:48:47,389 INFO L899 garLoopResultBuilder]: For program point L1662-2(line 1662) no Hoare annotation was computed. [2023-11-29 06:48:47,390 INFO L895 garLoopResultBuilder]: At program point L1662-4(line 1662) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-29 06:48:47,390 INFO L899 garLoopResultBuilder]: For program point L1662-5(line 1662) no Hoare annotation was computed. [2023-11-29 06:48:47,390 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1658 1665) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-29 06:48:47,390 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2023-11-29 06:48:47,390 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-29 06:48:47,390 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-29 06:48:47,391 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1649 1656) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-29 06:48:47,391 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2023-11-29 06:48:47,391 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2023-11-29 06:48:47,391 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2023-11-29 06:48:47,391 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2023-11-29 06:48:47,391 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2556 2558) the Hoare annotation is: true [2023-11-29 06:48:47,391 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2539 2541) the Hoare annotation is: true [2023-11-29 06:48:47,391 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_name_returnLabel#1(lines 1755 1769) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L2249-1(lines 2238 2252) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L895 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_returnLabel#1(lines 2012 2130) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2023-11-29 06:48:47,392 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L895 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L895 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L895 garLoopResultBuilder]: At program point L2154(lines 2154 2155) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L2154-1(lines 2154 2155) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L2122(lines 2024 2129) no Hoare annotation was computed. [2023-11-29 06:48:47,393 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L895 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L895 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2023-11-29 06:48:47,394 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2023-11-29 06:48:47,395 INFO L895 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,395 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2023-11-29 06:48:47,395 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2023-11-29 06:48:47,395 INFO L895 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,395 INFO L899 garLoopResultBuilder]: For program point L2190(lines 2138 2195) no Hoare annotation was computed. [2023-11-29 06:48:47,395 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2023-11-29 06:48:47,395 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2023-11-29 06:48:47,395 INFO L895 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,395 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L895 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,396 INFO L895 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L895 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2023-11-29 06:48:47,396 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L895 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L895 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L895 garLoopResultBuilder]: At program point L2262(lines 2262 2263) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2262-1(lines 2262 2263) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L895 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point ibmpex_register_bmc_returnLabel#1(lines 2131 2196) no Hoare annotation was computed. [2023-11-29 06:48:47,397 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L895 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2264-1(lines 2254 2286) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L895 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L895 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2365(lines 2337 2377) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L895 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-29 06:48:47,398 INFO L895 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,398 INFO L899 garLoopResultBuilder]: For program point $Ultimate##93(lines 1864 1867) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point is_power_sensor_returnLabel#1(lines 1916 1931) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point $Ultimate##83(lines 2117 2120) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point get_bmc_data_returnLabel#1(lines 1842 1870) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_ldv_17748#1(lines 2302 2320) the Hoare annotation is: true [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2023-11-29 06:48:47,399 INFO L895 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2023-11-29 06:48:47,399 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point create_sensor_returnLabel#1(lines 1976 2011) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point $Ultimate##73(lines 2077 2080) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_exit_remove#1(lines 2024 2129) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L895 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2023-11-29 06:48:47,400 INFO L899 garLoopResultBuilder]: For program point L2173-1(lines 2173 2174) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L895 garLoopResultBuilder]: At program point L2173(lines 2173 2174) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,401 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2023-11-29 06:48:47,401 INFO L899 garLoopResultBuilder]: For program point $Ultimate##45(lines 1969 1972) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L899 garLoopResultBuilder]: For program point ibmpex_ver_check_returnLabel#1(lines 1720 1740) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L899 garLoopResultBuilder]: For program point is_temp_sensor_returnLabel#1(lines 1932 1947) no Hoare annotation was computed. [2023-11-29 06:48:47,401 INFO L895 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2023-11-29 06:48:47,402 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2023-11-29 06:48:47,402 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2023-11-29 06:48:47,402 INFO L895 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,402 INFO L895 garLoopResultBuilder]: At program point L2142(line 2142) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,402 INFO L899 garLoopResultBuilder]: For program point L2142-1(line 2142) no Hoare annotation was computed. [2023-11-29 06:48:47,402 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2023-11-29 06:48:47,402 INFO L899 garLoopResultBuilder]: For program point power_sensor_multiplier_returnLabel#1(lines 1948 1975) no Hoare annotation was computed. [2023-11-29 06:48:47,402 INFO L895 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,403 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2023-11-29 06:48:47,403 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2023-11-29 06:48:47,403 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2337 2377) no Hoare annotation was computed. [2023-11-29 06:48:47,403 INFO L895 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,403 INFO L895 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,403 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2023-11-29 06:48:47,403 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:48:47,403 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L895 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,404 INFO L895 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2023-11-29 06:48:47,404 INFO L895 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2023-11-29 06:48:47,405 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,405 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,405 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-29 06:48:47,405 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,405 INFO L899 garLoopResultBuilder]: For program point L2114(lines 2024 2129) no Hoare annotation was computed. [2023-11-29 06:48:47,405 INFO L899 garLoopResultBuilder]: For program point L2081(lines 2024 2129) no Hoare annotation was computed. [2023-11-29 06:48:47,405 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2023-11-29 06:48:47,405 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_count_returnLabel#1(lines 1741 1754) no Hoare annotation was computed. [2023-11-29 06:48:47,405 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2023-11-29 06:48:47,406 INFO L895 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2023-11-29 06:48:47,406 INFO L899 garLoopResultBuilder]: For program point $Ultimate##117(lines 2315 2318) no Hoare annotation was computed. [2023-11-29 06:48:47,406 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2023-11-29 06:48:47,406 INFO L895 garLoopResultBuilder]: At program point L2182(lines 2182 2183) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-29 06:48:47,406 INFO L899 garLoopResultBuilder]: For program point L2182-1(lines 2182 2183) no Hoare annotation was computed. [2023-11-29 06:48:47,406 INFO L899 garLoopResultBuilder]: For program point L2083(lines 2024 2129) no Hoare annotation was computed. [2023-11-29 06:48:47,409 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:48:47,411 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:48:47,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-29 06:48:47,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-29 06:48:47,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-29 06:48:47,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-29 06:48:47,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-29 06:48:47,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-29 06:48:47,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-29 06:48:47,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:48:47 BoogieIcfgContainer [2023-11-29 06:48:47,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:48:47,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:48:47,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:48:47,430 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:48:47,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:47:35" (3/4) ... [2023-11-29 06:48:47,432 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-29 06:48:47,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2023-11-29 06:48:47,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2023-11-29 06:48:47,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-29 06:48:47,460 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 167 nodes and edges [2023-11-29 06:48:47,463 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2023-11-29 06:48:47,465 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-29 06:48:47,468 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 06:48:47,471 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:48:47,473 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:48:47,701 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:48:47,701 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:48:47,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:48:47,702 INFO L158 Benchmark]: Toolchain (without parser) took 75054.55ms. Allocated memory was 138.4MB in the beginning and 627.0MB in the end (delta: 488.6MB). Free memory was 102.8MB in the beginning and 320.2MB in the end (delta: -217.4MB). Peak memory consumption was 272.8MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,702 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:48:47,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.80ms. Allocated memory is still 138.4MB. Free memory was 102.4MB in the beginning and 53.2MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.57ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 53.2MB in the beginning and 162.8MB in the end (delta: -109.6MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,703 INFO L158 Benchmark]: Boogie Preprocessor took 262.85ms. Allocated memory is still 201.3MB. Free memory was 162.8MB in the beginning and 131.2MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,704 INFO L158 Benchmark]: RCFGBuilder took 1536.72ms. Allocated memory is still 201.3MB. Free memory was 131.2MB in the beginning and 82.7MB in the end (delta: 48.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,704 INFO L158 Benchmark]: TraceAbstraction took 72081.46ms. Allocated memory was 201.3MB in the beginning and 627.0MB in the end (delta: 425.7MB). Free memory was 81.6MB in the beginning and 343.2MB in the end (delta: -261.6MB). Peak memory consumption was 316.2MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,704 INFO L158 Benchmark]: Witness Printer took 271.57ms. Allocated memory is still 627.0MB. Free memory was 343.2MB in the beginning and 320.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 06:48:47,706 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.19ms. Allocated memory is still 138.4MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.80ms. Allocated memory is still 138.4MB. Free memory was 102.4MB in the beginning and 53.2MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.57ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 53.2MB in the beginning and 162.8MB in the end (delta: -109.6MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 262.85ms. Allocated memory is still 201.3MB. Free memory was 162.8MB in the beginning and 131.2MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1536.72ms. Allocated memory is still 201.3MB. Free memory was 131.2MB in the beginning and 82.7MB in the end (delta: 48.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 72081.46ms. Allocated memory was 201.3MB in the beginning and 627.0MB in the end (delta: 425.7MB). Free memory was 81.6MB in the beginning and 343.2MB in the end (delta: -261.6MB). Peak memory consumption was 316.2MB. Max. memory is 16.1GB. * Witness Printer took 271.57ms. Allocated memory is still 627.0MB. Free memory was 343.2MB in the beginning and 320.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 * 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: 2415]: 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 19 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.0s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6330 SdHoareTripleChecker+Valid, 25.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5784 mSDsluCounter, 15201 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10213 mSDsCounter, 2831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10773 IncrementalHoareTripleChecker+Invalid, 13604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2831 mSolverCounterUnsat, 4988 mSDtfsCounter, 10773 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1171 GetRequests, 1067 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=12, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 4772 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 3384 PreInvPairs, 3669 NumberOfFragments, 2236 HoareAnnotationTreeSize, 3384 FomulaSimplifications, 32470946 FormulaSimplificationTreeSizeReduction, 28.9s HoareSimplificationTime, 74 FomulaSimplificationsInter, 125742 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2521 NumberOfCodeBlocks, 2521 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2654 ConstructedInterpolants, 0 QuantifiedInterpolants, 4624 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2958 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 1331/1335 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: 1695]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((((6 <= ldv_count_1) && (ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && (ldv_count_2 == 0)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute)) && ((5 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ((ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-29 06:48:47,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7449ed7c-4297-4801-ba57-64033efa8042/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE