./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:22:09,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:22:09,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-06 22:22:09,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:22:09,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:22:09,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:22:09,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:22:09,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:22:09,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:22:09,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:22:09,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:22:09,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:22:09,448 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:22:09,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:22:09,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:22:09,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:22:09,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:22:09,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:22:09,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:22:09,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:22:09,453 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:22:09,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:22:09,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:22:09,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:22:09,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:22:09,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:22:09,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:22:09,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:09,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:22:09,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:22:09,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:22:09,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:22:09,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:22:09,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:22:09,462 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:22:09,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:22:09,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:22:09,463 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:22:09,463 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_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/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_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! overflow) ) 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 -> 88f19b088f98626e870666f9633d9e7e34156d2b7ba315c9b1bc3979a22f8d34 [2023-11-06 22:22:09,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:22:09,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:22:09,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:22:09,819 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:22:09,819 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:22:09,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-06 22:22:12,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:22:13,268 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:22:13,269 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-06 22:22:13,288 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/data/103dbe317/acb112a764124e95b0cedd30b7db79e4/FLAG857eea4e9 [2023-11-06 22:22:13,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/data/103dbe317/acb112a764124e95b0cedd30b7db79e4 [2023-11-06 22:22:13,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:22:13,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:22:13,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:13,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:22:13,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:22:13,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:13" (1/1) ... [2023-11-06 22:22:13,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5ac7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:13, skipping insertion in model container [2023-11-06 22:22:13,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:13" (1/1) ... [2023-11-06 22:22:13,391 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:22:13,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:13,962 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:22:14,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:14,128 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:22:14,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14 WrapperNode [2023-11-06 22:22:14,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:14,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:14,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:22:14,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:22:14,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,244 INFO L138 Inliner]: procedures = 83, calls = 179, calls flagged for inlining = 34, calls inlined = 27, statements flattened = 559 [2023-11-06 22:22:14,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:14,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:22:14,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:22:14,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:22:14,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:22:14,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:22:14,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:22:14,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:22:14,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (1/1) ... [2023-11-06 22:22:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:14,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:22:14,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:22:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2023-11-06 22:22:14,424 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2023-11-06 22:22:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2023-11-06 22:22:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2023-11-06 22:22:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:22:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-06 22:22:14,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-06 22:22:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:22:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:22:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-06 22:22:14,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-06 22:22:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:22:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-06 22:22:14,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-06 22:22:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:22:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2023-11-06 22:22:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2023-11-06 22:22:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-06 22:22:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-06 22:22:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 22:22:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 22:22:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2023-11-06 22:22:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2023-11-06 22:22:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:22:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:22:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2023-11-06 22:22:14,428 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2023-11-06 22:22:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-06 22:22:14,428 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-06 22:22:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-06 22:22:14,429 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-06 22:22:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:22:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2023-11-06 22:22:14,429 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2023-11-06 22:22:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:22:14,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:22:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:22:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2023-11-06 22:22:14,430 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2023-11-06 22:22:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:22:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-06 22:22:14,430 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-06 22:22:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:22:14,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:22:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2023-11-06 22:22:14,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2023-11-06 22:22:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2023-11-06 22:22:14,431 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2023-11-06 22:22:14,671 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:22:14,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:22:15,142 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-06 22:22:15,447 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:22:15,463 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:22:15,463 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:22:15,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:15 BoogieIcfgContainer [2023-11-06 22:22:15,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:22:15,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:22:15,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:22:15,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:22:15,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:13" (1/3) ... [2023-11-06 22:22:15,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269016e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:15, skipping insertion in model container [2023-11-06 22:22:15,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:14" (2/3) ... [2023-11-06 22:22:15,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269016e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:15, skipping insertion in model container [2023-11-06 22:22:15,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:15" (3/3) ... [2023-11-06 22:22:15,479 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-06 22:22:15,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:22:15,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-06 22:22:15,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:22:15,599 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=LoopsAndPotentialCycles, 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;@7eae0f80, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:22:15,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:22:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 175 states have (on average 1.3485714285714285) internal successors, (236), 196 states have internal predecessors, (236), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 22:22:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:22:15,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:15,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:15,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:15,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1780244060, now seen corresponding path program 1 times [2023-11-06 22:22:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956603173] [2023-11-06 22:22:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:22:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:22:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956603173] [2023-11-06 22:22:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956603173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:16,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:16,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:22:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448464013] [2023-11-06 22:22:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:22:16,117 INFO L87 Difference]: Start difference. First operand has 257 states, 175 states have (on average 1.3485714285714285) internal successors, (236), 196 states have internal predecessors, (236), 48 states have call successors, (48), 18 states have call predecessors, (48), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:22:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:16,994 INFO L93 Difference]: Finished difference Result 559 states and 737 transitions. [2023-11-06 22:22:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:22:16,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-11-06 22:22:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:17,011 INFO L225 Difference]: With dead ends: 559 [2023-11-06 22:22:17,011 INFO L226 Difference]: Without dead ends: 281 [2023-11-06 22:22:17,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:17,023 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 97 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:17,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 578 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:22:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-06 22:22:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2023-11-06 22:22:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 197 states have internal predecessors, (240), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 22:22:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 328 transitions. [2023-11-06 22:22:17,104 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 328 transitions. Word has length 21 [2023-11-06 22:22:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:17,105 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 328 transitions. [2023-11-06 22:22:17,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:22:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 328 transitions. [2023-11-06 22:22:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:22:17,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:17,110 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:22:17,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:22:17,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:17,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 672969452, now seen corresponding path program 1 times [2023-11-06 22:22:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:17,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759797735] [2023-11-06 22:22:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:17,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:22:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759797735] [2023-11-06 22:22:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759797735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:22:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673902459] [2023-11-06 22:22:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:17,404 INFO L87 Difference]: Start difference. First operand 258 states and 328 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:22:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:18,353 INFO L93 Difference]: Finished difference Result 559 states and 719 transitions. [2023-11-06 22:22:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:22:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-11-06 22:22:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:18,360 INFO L225 Difference]: With dead ends: 559 [2023-11-06 22:22:18,361 INFO L226 Difference]: Without dead ends: 553 [2023-11-06 22:22:18,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:18,363 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 432 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:18,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 585 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:22:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2023-11-06 22:22:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 497. [2023-11-06 22:22:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 359 states have (on average 1.3119777158774373) internal successors, (471), 376 states have internal predecessors, (471), 88 states have call successors, (88), 34 states have call predecessors, (88), 34 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-06 22:22:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 647 transitions. [2023-11-06 22:22:18,426 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 647 transitions. Word has length 45 [2023-11-06 22:22:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:18,427 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 647 transitions. [2023-11-06 22:22:18,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:22:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 647 transitions. [2023-11-06 22:22:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:22:18,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:18,433 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:22:18,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:22:18,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:18,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1087831482, now seen corresponding path program 1 times [2023-11-06 22:22:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087592530] [2023-11-06 22:22:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:22:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:22:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:22:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:22:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087592530] [2023-11-06 22:22:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087592530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629421540] [2023-11-06 22:22:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:18,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:18,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:18,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:18,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:22:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:18,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:22:18,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:22:19,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629421540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2023-11-06 22:22:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298683991] [2023-11-06 22:22:19,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:19,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:22:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:19,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:22:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:22:19,053 INFO L87 Difference]: Start difference. First operand 497 states and 647 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:22:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:19,134 INFO L93 Difference]: Finished difference Result 1178 states and 1528 transitions. [2023-11-06 22:22:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:22:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2023-11-06 22:22:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:19,145 INFO L225 Difference]: With dead ends: 1178 [2023-11-06 22:22:19,146 INFO L226 Difference]: Without dead ends: 684 [2023-11-06 22:22:19,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:22:19,162 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 224 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:19,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 619 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:22:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-11-06 22:22:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 672. [2023-11-06 22:22:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 493 states have (on average 1.306288032454361) internal successors, (644), 511 states have internal predecessors, (644), 116 states have call successors, (116), 47 states have call predecessors, (116), 47 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2023-11-06 22:22:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 876 transitions. [2023-11-06 22:22:19,226 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 876 transitions. Word has length 66 [2023-11-06 22:22:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:19,227 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 876 transitions. [2023-11-06 22:22:19,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:22:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 876 transitions. [2023-11-06 22:22:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:22:19,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:19,231 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 22:22:19,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:19,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-06 22:22:19,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:19,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -647164207, now seen corresponding path program 1 times [2023-11-06 22:22:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593366496] [2023-11-06 22:22:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:22:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:22:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593366496] [2023-11-06 22:22:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593366496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:19,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:19,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:22:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439951982] [2023-11-06 22:22:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:19,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:19,625 INFO L87 Difference]: Start difference. First operand 672 states and 876 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:22:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:20,402 INFO L93 Difference]: Finished difference Result 1270 states and 1647 transitions. [2023-11-06 22:22:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:22:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2023-11-06 22:22:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:20,409 INFO L225 Difference]: With dead ends: 1270 [2023-11-06 22:22:20,409 INFO L226 Difference]: Without dead ends: 809 [2023-11-06 22:22:20,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:22:20,412 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 190 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:20,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 774 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:22:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2023-11-06 22:22:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 755. [2023-11-06 22:22:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 553 states have (on average 1.298372513562387) internal successors, (718), 571 states have internal predecessors, (718), 128 states have call successors, (128), 58 states have call predecessors, (128), 58 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-06 22:22:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 974 transitions. [2023-11-06 22:22:20,475 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 974 transitions. Word has length 64 [2023-11-06 22:22:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:20,476 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 974 transitions. [2023-11-06 22:22:20,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:22:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 974 transitions. [2023-11-06 22:22:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:22:20,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:20,478 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:22:20,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:22:20,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:20,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash -638054186, now seen corresponding path program 1 times [2023-11-06 22:22:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:20,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420152606] [2023-11-06 22:22:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:22:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:22:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:22:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:20,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420152606] [2023-11-06 22:22:20,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420152606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:20,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:20,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081387005] [2023-11-06 22:22:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:20,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:20,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:22:20,665 INFO L87 Difference]: Start difference. First operand 755 states and 974 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:22:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:21,083 INFO L93 Difference]: Finished difference Result 1653 states and 2176 transitions. [2023-11-06 22:22:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2023-11-06 22:22:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:21,094 INFO L225 Difference]: With dead ends: 1653 [2023-11-06 22:22:21,094 INFO L226 Difference]: Without dead ends: 901 [2023-11-06 22:22:21,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:22:21,098 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 97 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:21,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 593 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:22:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2023-11-06 22:22:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 857. [2023-11-06 22:22:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 634 states have (on average 1.3028391167192428) internal successors, (826), 652 states have internal predecessors, (826), 149 states have call successors, (149), 58 states have call predecessors, (149), 58 states have return successors, (149), 149 states have call predecessors, (149), 149 states have call successors, (149) [2023-11-06 22:22:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1124 transitions. [2023-11-06 22:22:21,210 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1124 transitions. Word has length 84 [2023-11-06 22:22:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:21,212 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1124 transitions. [2023-11-06 22:22:21,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:22:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1124 transitions. [2023-11-06 22:22:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:22:21,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:21,216 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:22:21,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:22:21,217 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:21,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash -97505822, now seen corresponding path program 1 times [2023-11-06 22:22:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:21,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830965591] [2023-11-06 22:22:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:22:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:22:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:22:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:22:21,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:21,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830965591] [2023-11-06 22:22:21,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830965591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:21,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:21,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:22:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6430999] [2023-11-06 22:22:21,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:21,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:21,434 INFO L87 Difference]: Start difference. First operand 857 states and 1124 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:22:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:22,055 INFO L93 Difference]: Finished difference Result 1535 states and 2032 transitions. [2023-11-06 22:22:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:22:22,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2023-11-06 22:22:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:22,063 INFO L225 Difference]: With dead ends: 1535 [2023-11-06 22:22:22,064 INFO L226 Difference]: Without dead ends: 923 [2023-11-06 22:22:22,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:22:22,067 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 70 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:22,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 697 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:22:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-11-06 22:22:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 865. [2023-11-06 22:22:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 640 states have (on average 1.3) internal successors, (832), 658 states have internal predecessors, (832), 151 states have call successors, (151), 58 states have call predecessors, (151), 58 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2023-11-06 22:22:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1134 transitions. [2023-11-06 22:22:22,151 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1134 transitions. Word has length 86 [2023-11-06 22:22:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:22,151 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 1134 transitions. [2023-11-06 22:22:22,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:22:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1134 transitions. [2023-11-06 22:22:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:22:22,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:22,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:22,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:22:22,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:22,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1729177992, now seen corresponding path program 1 times [2023-11-06 22:22:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:22,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043607035] [2023-11-06 22:22:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:22:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:22:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:22:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043607035] [2023-11-06 22:22:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043607035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258126073] [2023-11-06 22:22:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:22,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:22,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:22,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:22,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:22:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:22,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:22,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:22,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258126073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:22,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-06 22:22:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564343464] [2023-11-06 22:22:22,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:22:22,658 INFO L87 Difference]: Start difference. First operand 865 states and 1134 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:22:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:22,786 INFO L93 Difference]: Finished difference Result 1733 states and 2280 transitions. [2023-11-06 22:22:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:22,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-11-06 22:22:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:22,793 INFO L225 Difference]: With dead ends: 1733 [2023-11-06 22:22:22,794 INFO L226 Difference]: Without dead ends: 871 [2023-11-06 22:22:22,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 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-06 22:22:22,798 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:22,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 617 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:22:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-11-06 22:22:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2023-11-06 22:22:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 643 states have (on average 1.2846034214618973) internal successors, (826), 658 states have internal predecessors, (826), 151 states have call successors, (151), 58 states have call predecessors, (151), 58 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2023-11-06 22:22:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1128 transitions. [2023-11-06 22:22:22,895 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1128 transitions. Word has length 89 [2023-11-06 22:22:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:22,896 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 1128 transitions. [2023-11-06 22:22:22,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:22:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1128 transitions. [2023-11-06 22:22:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-06 22:22:22,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:22,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-06 22:22:22,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:23,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:22:23,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:23,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2064910399, now seen corresponding path program 1 times [2023-11-06 22:22:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:23,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274838945] [2023-11-06 22:22:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:22:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:22:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:22:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274838945] [2023-11-06 22:22:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274838945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786158981] [2023-11-06 22:22:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:23,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:23,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:23,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:23,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:22:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:23,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:23,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:23,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:22:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786158981] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:22:23,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:22:23,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2023-11-06 22:22:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184402776] [2023-11-06 22:22:23,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:22:23,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:22:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:22:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:22:23,813 INFO L87 Difference]: Start difference. First operand 865 states and 1128 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:22:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:24,334 INFO L93 Difference]: Finished difference Result 1073 states and 1432 transitions. [2023-11-06 22:22:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:22:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-11-06 22:22:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:24,342 INFO L225 Difference]: With dead ends: 1073 [2023-11-06 22:22:24,342 INFO L226 Difference]: Without dead ends: 1070 [2023-11-06 22:22:24,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:22:24,345 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 306 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:24,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 625 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:22:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2023-11-06 22:22:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 850. [2023-11-06 22:22:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 634 states have (on average 1.274447949526814) internal successors, (808), 646 states have internal predecessors, (808), 148 states have call successors, (148), 58 states have call predecessors, (148), 58 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2023-11-06 22:22:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1104 transitions. [2023-11-06 22:22:24,417 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1104 transitions. Word has length 90 [2023-11-06 22:22:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:24,418 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1104 transitions. [2023-11-06 22:22:24,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:22:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1104 transitions. [2023-11-06 22:22:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:22:24,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:24,421 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:24,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:22:24,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:24,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:24,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1844226329, now seen corresponding path program 2 times [2023-11-06 22:22:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:24,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383611612] [2023-11-06 22:22:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:22:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:22:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:22:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:22:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383611612] [2023-11-06 22:22:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383611612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:22:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748029041] [2023-11-06 22:22:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:24,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:24,819 INFO L87 Difference]: Start difference. First operand 850 states and 1104 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:22:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:25,288 INFO L93 Difference]: Finished difference Result 1453 states and 1888 transitions. [2023-11-06 22:22:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:22:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 88 [2023-11-06 22:22:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:25,293 INFO L225 Difference]: With dead ends: 1453 [2023-11-06 22:22:25,294 INFO L226 Difference]: Without dead ends: 580 [2023-11-06 22:22:25,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:25,300 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 348 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:25,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 400 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:22:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-11-06 22:22:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 547. [2023-11-06 22:22:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 402 states have (on average 1.2462686567164178) internal successors, (501), 411 states have internal predecessors, (501), 96 states have call successors, (96), 41 states have call predecessors, (96), 41 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-06 22:22:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 693 transitions. [2023-11-06 22:22:25,379 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 693 transitions. Word has length 88 [2023-11-06 22:22:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:25,380 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 693 transitions. [2023-11-06 22:22:25,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:22:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 693 transitions. [2023-11-06 22:22:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 22:22:25,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:25,382 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:22:25,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:22:25,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:25,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1622746520, now seen corresponding path program 1 times [2023-11-06 22:22:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966600251] [2023-11-06 22:22:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:22:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:22:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:22:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:22:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966600251] [2023-11-06 22:22:25,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966600251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:25,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:25,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:22:25,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928843137] [2023-11-06 22:22:25,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:25,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:22:25,710 INFO L87 Difference]: Start difference. First operand 547 states and 693 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:22:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:26,288 INFO L93 Difference]: Finished difference Result 1123 states and 1433 transitions. [2023-11-06 22:22:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:22:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2023-11-06 22:22:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:26,296 INFO L225 Difference]: With dead ends: 1123 [2023-11-06 22:22:26,297 INFO L226 Difference]: Without dead ends: 1121 [2023-11-06 22:22:26,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:22:26,298 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 322 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:26,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 632 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:22:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2023-11-06 22:22:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1057. [2023-11-06 22:22:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 777 states have (on average 1.2406692406692406) internal successors, (964), 788 states have internal predecessors, (964), 190 states have call successors, (190), 82 states have call predecessors, (190), 82 states have return successors, (200), 190 states have call predecessors, (200), 190 states have call successors, (200) [2023-11-06 22:22:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1354 transitions. [2023-11-06 22:22:26,428 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1354 transitions. Word has length 96 [2023-11-06 22:22:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:26,429 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1354 transitions. [2023-11-06 22:22:26,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:22:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1354 transitions. [2023-11-06 22:22:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:22:26,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:26,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-06 22:22:26,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:22:26,434 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:26,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 578204635, now seen corresponding path program 1 times [2023-11-06 22:22:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521257579] [2023-11-06 22:22:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:22:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:22:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:22:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:22:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:22:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 22:22:26,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521257579] [2023-11-06 22:22:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521257579] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388694007] [2023-11-06 22:22:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:26,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:26,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:22:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:26,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:22:26,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 22:22:26,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388694007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-11-06 22:22:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079209382] [2023-11-06 22:22:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:26,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:22:26,918 INFO L87 Difference]: Start difference. First operand 1057 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:22:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:27,146 INFO L93 Difference]: Finished difference Result 2535 states and 3247 transitions. [2023-11-06 22:22:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:22:27,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2023-11-06 22:22:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:27,160 INFO L225 Difference]: With dead ends: 2535 [2023-11-06 22:22:27,160 INFO L226 Difference]: Without dead ends: 1923 [2023-11-06 22:22:27,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:22:27,164 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 227 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:27,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1408 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:22:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2023-11-06 22:22:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1493. [2023-11-06 22:22:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1097 states have (on average 1.236098450319052) internal successors, (1356), 1114 states have internal predecessors, (1356), 270 states have call successors, (270), 112 states have call predecessors, (270), 118 states have return successors, (291), 272 states have call predecessors, (291), 270 states have call successors, (291) [2023-11-06 22:22:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1917 transitions. [2023-11-06 22:22:27,336 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1917 transitions. Word has length 101 [2023-11-06 22:22:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:27,337 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1917 transitions. [2023-11-06 22:22:27,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:22:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1917 transitions. [2023-11-06 22:22:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:22:27,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:27,340 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-06 22:22:27,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:27,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:27,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:27,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1798506678, now seen corresponding path program 1 times [2023-11-06 22:22:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860822254] [2023-11-06 22:22:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:22:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:22:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:22:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:22:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:22:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 22:22:27,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860822254] [2023-11-06 22:22:27,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860822254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718573471] [2023-11-06 22:22:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:27,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:27,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:27,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:27,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:22:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:28,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:22:28,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 22:22:28,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:28,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718573471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:28,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:28,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-11-06 22:22:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989441211] [2023-11-06 22:22:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:28,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:22:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:22:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:22:28,045 INFO L87 Difference]: Start difference. First operand 1493 states and 1917 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:22:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:28,304 INFO L93 Difference]: Finished difference Result 2995 states and 3834 transitions. [2023-11-06 22:22:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:22:28,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2023-11-06 22:22:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:28,322 INFO L225 Difference]: With dead ends: 2995 [2023-11-06 22:22:28,323 INFO L226 Difference]: Without dead ends: 2375 [2023-11-06 22:22:28,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:22:28,327 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 227 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:28,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1406 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:22:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2023-11-06 22:22:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1493. [2023-11-06 22:22:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1097 states have (on average 1.236098450319052) internal successors, (1356), 1114 states have internal predecessors, (1356), 270 states have call successors, (270), 112 states have call predecessors, (270), 118 states have return successors, (291), 272 states have call predecessors, (291), 270 states have call successors, (291) [2023-11-06 22:22:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1917 transitions. [2023-11-06 22:22:28,541 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1917 transitions. Word has length 105 [2023-11-06 22:22:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:28,541 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1917 transitions. [2023-11-06 22:22:28,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:22:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1917 transitions. [2023-11-06 22:22:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:22:28,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:28,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:28,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:28,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:28,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:28,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1830236822, now seen corresponding path program 1 times [2023-11-06 22:22:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:28,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727014073] [2023-11-06 22:22:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:22:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:22:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:22:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:22:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:22:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:22:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727014073] [2023-11-06 22:22:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727014073] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403468079] [2023-11-06 22:22:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:29,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:29,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:29,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:22:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:29,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:22:29,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:22:30,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403468079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:30,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2023-11-06 22:22:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669669855] [2023-11-06 22:22:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:30,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:22:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:22:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:22:30,042 INFO L87 Difference]: Start difference. First operand 1493 states and 1917 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:22:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:30,600 INFO L93 Difference]: Finished difference Result 1511 states and 1926 transitions. [2023-11-06 22:22:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:22:30,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 115 [2023-11-06 22:22:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:30,626 INFO L225 Difference]: With dead ends: 1511 [2023-11-06 22:22:30,626 INFO L226 Difference]: Without dead ends: 752 [2023-11-06 22:22:30,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:22:30,629 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 280 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:30,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 471 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:22:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2023-11-06 22:22:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2023-11-06 22:22:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 551 states have (on average 1.2304900181488203) internal successors, (678), 561 states have internal predecessors, (678), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2023-11-06 22:22:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 953 transitions. [2023-11-06 22:22:30,729 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 953 transitions. Word has length 115 [2023-11-06 22:22:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:30,730 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 953 transitions. [2023-11-06 22:22:30,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:22:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 953 transitions. [2023-11-06 22:22:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:22:30,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:30,733 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:30,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:22:30,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:30,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 180196228, now seen corresponding path program 1 times [2023-11-06 22:22:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063048369] [2023-11-06 22:22:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:22:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-06 22:22:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:22:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:22:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 22:22:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:22:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:22:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:31,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063048369] [2023-11-06 22:22:31,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063048369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:31,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:31,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:22:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224403765] [2023-11-06 22:22:31,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:31,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:22:31,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:22:31,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:22:31,192 INFO L87 Difference]: Start difference. First operand 752 states and 953 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, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:22:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:31,797 INFO L93 Difference]: Finished difference Result 1528 states and 1934 transitions. [2023-11-06 22:22:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:22:31,798 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, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2023-11-06 22:22:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:31,803 INFO L225 Difference]: With dead ends: 1528 [2023-11-06 22:22:31,803 INFO L226 Difference]: Without dead ends: 801 [2023-11-06 22:22:31,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:31,806 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 228 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:31,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 575 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:22:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2023-11-06 22:22:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 752. [2023-11-06 22:22:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 551 states have (on average 1.2250453720508168) internal successors, (675), 558 states have internal predecessors, (675), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2023-11-06 22:22:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 950 transitions. [2023-11-06 22:22:31,914 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 950 transitions. Word has length 131 [2023-11-06 22:22:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:31,915 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 950 transitions. [2023-11-06 22:22:31,916 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, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:22:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 950 transitions. [2023-11-06 22:22:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:22:31,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:31,919 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:22:31,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:31,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1677364098, now seen corresponding path program 1 times [2023-11-06 22:22:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:31,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679898452] [2023-11-06 22:22:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:22:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:22:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:22:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:22:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:22:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:22:32,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679898452] [2023-11-06 22:22:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679898452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682572828] [2023-11-06 22:22:32,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:32,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:32,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:32,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:32,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:22:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:32,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:32,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:22:32,525 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682572828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:32,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:32,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 22:22:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338390707] [2023-11-06 22:22:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:32,528 INFO L87 Difference]: Start difference. First operand 752 states and 950 transitions. Second operand has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:22:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:32,666 INFO L93 Difference]: Finished difference Result 752 states and 950 transitions. [2023-11-06 22:22:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2023-11-06 22:22:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:32,671 INFO L225 Difference]: With dead ends: 752 [2023-11-06 22:22:32,672 INFO L226 Difference]: Without dead ends: 751 [2023-11-06 22:22:32,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:32,675 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 11 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:32,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 543 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:22:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-11-06 22:22:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2023-11-06 22:22:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 551 states have (on average 1.2232304900181488) internal successors, (674), 557 states have internal predecessors, (674), 136 states have call successors, (136), 56 states have call predecessors, (136), 59 states have return successors, (139), 137 states have call predecessors, (139), 136 states have call successors, (139) [2023-11-06 22:22:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 949 transitions. [2023-11-06 22:22:32,786 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 949 transitions. Word has length 134 [2023-11-06 22:22:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:32,786 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 949 transitions. [2023-11-06 22:22:32,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:22:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 949 transitions. [2023-11-06 22:22:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 22:22:32,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:32,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:32,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:32,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:22:32,997 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:32,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash -458679229, now seen corresponding path program 1 times [2023-11-06 22:22:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639590572] [2023-11-06 22:22:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:22:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:22:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:22:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:22:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:22:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:22:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639590572] [2023-11-06 22:22:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639590572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548538694] [2023-11-06 22:22:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:33,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:33,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:33,265 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:33,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:22:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:33,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:33,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:22:33,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:22:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:22:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548538694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:22:33,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:22:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2023-11-06 22:22:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992892624] [2023-11-06 22:22:33,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:22:33,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:22:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:22:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:22:33,696 INFO L87 Difference]: Start difference. First operand 751 states and 949 transitions. Second operand has 9 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-11-06 22:22:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:34,499 INFO L93 Difference]: Finished difference Result 814 states and 1039 transitions. [2023-11-06 22:22:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:22:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 135 [2023-11-06 22:22:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:34,506 INFO L225 Difference]: With dead ends: 814 [2023-11-06 22:22:34,506 INFO L226 Difference]: Without dead ends: 813 [2023-11-06 22:22:34,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:22:34,508 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 124 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:34,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 629 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:22:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-11-06 22:22:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 747. [2023-11-06 22:22:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 549 states have (on average 1.2222222222222223) internal successors, (671), 554 states have internal predecessors, (671), 135 states have call successors, (135), 56 states have call predecessors, (135), 59 states have return successors, (138), 136 states have call predecessors, (138), 135 states have call successors, (138) [2023-11-06 22:22:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 944 transitions. [2023-11-06 22:22:34,617 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 944 transitions. Word has length 135 [2023-11-06 22:22:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:34,617 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 944 transitions. [2023-11-06 22:22:34,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-11-06 22:22:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 944 transitions. [2023-11-06 22:22:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:22:34,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:34,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:22:34,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:34,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:22:34,829 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:34,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 564874876, now seen corresponding path program 1 times [2023-11-06 22:22:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478003716] [2023-11-06 22:22:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:34,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:22:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:22:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:22:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:22:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:22:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:22:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:22:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478003716] [2023-11-06 22:22:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478003716] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369768200] [2023-11-06 22:22:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:35,131 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:35,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:22:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:35,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:35,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:22:35,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:22:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369768200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:22:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 22:22:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431526013] [2023-11-06 22:22:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:35,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:22:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:22:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:35,662 INFO L87 Difference]: Start difference. First operand 747 states and 944 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:22:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:35,888 INFO L93 Difference]: Finished difference Result 747 states and 944 transitions. [2023-11-06 22:22:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:22:35,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2023-11-06 22:22:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:35,896 INFO L225 Difference]: With dead ends: 747 [2023-11-06 22:22:35,897 INFO L226 Difference]: Without dead ends: 745 [2023-11-06 22:22:35,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:22:35,898 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 212 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:35,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 479 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:22:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-11-06 22:22:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2023-11-06 22:22:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 549 states have (on average 1.2185792349726776) internal successors, (669), 552 states have internal predecessors, (669), 135 states have call successors, (135), 56 states have call predecessors, (135), 59 states have return successors, (138), 136 states have call predecessors, (138), 135 states have call successors, (138) [2023-11-06 22:22:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 942 transitions. [2023-11-06 22:22:36,008 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 942 transitions. Word has length 136 [2023-11-06 22:22:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:36,010 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 942 transitions. [2023-11-06 22:22:36,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:22:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 942 transitions. [2023-11-06 22:22:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:22:36,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:36,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:22:36,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:36,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:22:36,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-11-06 22:22:36,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 331252328, now seen corresponding path program 1 times [2023-11-06 22:22:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19861715] [2023-11-06 22:22:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:22:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:22:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:22:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:22:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:22:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:22:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:22:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:22:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:22:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:22:36,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19861715] [2023-11-06 22:22:36,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19861715] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:36,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580179443] [2023-11-06 22:22:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:36,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:36,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:36,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:22:36,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:22:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:36,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:22:36,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:22:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:22:37,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:22:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:22:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580179443] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:22:37,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:22:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2023-11-06 22:22:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688028519] [2023-11-06 22:22:37,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:22:37,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:22:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:22:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:22:37,269 INFO L87 Difference]: Start difference. First operand 745 states and 942 transitions. Second operand has 9 states, 8 states have (on average 27.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2023-11-06 22:22:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:38,147 INFO L93 Difference]: Finished difference Result 771 states and 977 transitions. [2023-11-06 22:22:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:22:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 27.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 137 [2023-11-06 22:22:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:38,149 INFO L225 Difference]: With dead ends: 771 [2023-11-06 22:22:38,149 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:22:38,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:22:38,152 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 783 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:38,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 471 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:22:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:22:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:22:38,153 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-06 22:22:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:22:38,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2023-11-06 22:22:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:38,154 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:22:38,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 27.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2023-11-06 22:22:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:22:38,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:22:38,157 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-11-06 22:22:38,158 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-11-06 22:22:38,158 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-11-06 22:22:38,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-11-06 22:22:38,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-11-06 22:22:38,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-11-06 22:22:38,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-11-06 22:22:38,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-11-06 22:22:38,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-11-06 22:22:38,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-11-06 22:22:38,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-11-06 22:22:38,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-11-06 22:22:38,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-11-06 22:22:38,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-11-06 22:22:38,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-11-06 22:22:38,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-11-06 22:22:38,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:38,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:22:38,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:22:48,921 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 940 945) the Hoare annotation is: true [2023-11-06 22:22:48,921 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 940 945) no Hoare annotation was computed. [2023-11-06 22:22:48,921 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 940 945) no Hoare annotation was computed. [2023-11-06 22:22:48,921 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_8_returnLabel#1(lines 1348 1355) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,922 INFO L895 garLoopResultBuilder]: At program point L1142(lines 1053 1148) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,922 INFO L895 garLoopResultBuilder]: At program point L1109(line 1109) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (or (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483645)) (= |s3c_hwmon_probe_~i~0#1| 0)) (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,922 INFO L895 garLoopResultBuilder]: At program point L1076(line 1076) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,923 INFO L899 garLoopResultBuilder]: For program point L1109-1(line 1109) no Hoare annotation was computed. [2023-11-06 22:22:48,923 INFO L895 garLoopResultBuilder]: At program point err_hwmon_register(lines 1053 1148) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,923 INFO L899 garLoopResultBuilder]: For program point L1076-1(line 1076) no Hoare annotation was computed. [2023-11-06 22:22:48,923 INFO L895 garLoopResultBuilder]: At program point L1010(line 1010) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,924 INFO L899 garLoopResultBuilder]: For program point L1010-1(line 1010) no Hoare annotation was computed. [2023-11-06 22:22:48,924 INFO L895 garLoopResultBuilder]: At program point $Ultimate##39(lines 1134 1137) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0 .cse1 .cse2) (< 0 ~ref_cnt~0) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,924 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeFINAL(lines 1040 1149) no Hoare annotation was computed. [2023-11-06 22:22:48,924 INFO L895 garLoopResultBuilder]: At program point $Ultimate##37(lines 1124 1127) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (<= |s3c_hwmon_probe_~i~0#1| 2147483645) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,925 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,925 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2023-11-06 22:22:48,925 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2023-11-06 22:22:48,925 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2023-11-06 22:22:48,925 INFO L895 garLoopResultBuilder]: At program point L1507(line 1507) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,926 INFO L899 garLoopResultBuilder]: For program point L1507-1(line 1507) no Hoare annotation was computed. [2023-11-06 22:22:48,926 INFO L895 garLoopResultBuilder]: At program point __mutex_init_returnLabel#1(lines 1455 1457) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,926 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 838) no Hoare annotation was computed. [2023-11-06 22:22:48,926 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2023-11-06 22:22:48,926 INFO L895 garLoopResultBuilder]: At program point platform_set_drvdata_returnLabel#1(lines 903 909) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,927 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,927 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2023-11-06 22:22:48,927 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 1107) no Hoare annotation was computed. [2023-11-06 22:22:48,927 INFO L899 garLoopResultBuilder]: For program point L1103-2(lines 1103 1107) no Hoare annotation was computed. [2023-11-06 22:22:48,927 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1040 1149) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,928 INFO L895 garLoopResultBuilder]: At program point ldv_kzalloc_9_returnLabel#1(lines 1356 1363) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,928 INFO L895 garLoopResultBuilder]: At program point L1087(line 1087) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,928 INFO L899 garLoopResultBuilder]: For program point L1087-1(line 1087) no Hoare annotation was computed. [2023-11-06 22:22:48,928 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1053 1148) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,928 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2023-11-06 22:22:48,929 INFO L895 garLoopResultBuilder]: At program point s3c_adc_register_returnLabel#1(lines 1506 1508) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,929 INFO L895 garLoopResultBuilder]: At program point L1352(line 1352) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,929 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2023-11-06 22:22:48,929 INFO L899 garLoopResultBuilder]: For program point L1352-1(line 1352) no Hoare annotation was computed. [2023-11-06 22:22:48,929 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeEXIT(lines 1040 1149) no Hoare annotation was computed. [2023-11-06 22:22:48,930 INFO L899 garLoopResultBuilder]: For program point L1121(line 1121) no Hoare annotation was computed. [2023-11-06 22:22:48,930 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1094) no Hoare annotation was computed. [2023-11-06 22:22:48,930 INFO L895 garLoopResultBuilder]: At program point L1344(line 1344) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,930 INFO L899 garLoopResultBuilder]: For program point L1344-1(line 1344) no Hoare annotation was computed. [2023-11-06 22:22:48,930 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2023-11-06 22:22:48,930 INFO L895 garLoopResultBuilder]: At program point ldv_zalloc_returnLabel#1(lines 823 840) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,931 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1028) no Hoare annotation was computed. [2023-11-06 22:22:48,931 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2023-11-06 22:22:48,931 INFO L899 garLoopResultBuilder]: For program point L1014-1(lines 1014 1028) no Hoare annotation was computed. [2023-11-06 22:22:48,931 INFO L895 garLoopResultBuilder]: At program point ldv_10008(lines 1115 1129) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 0 |s3c_hwmon_probe_~i~0#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (<= |s3c_hwmon_probe_~i~0#1| 2147483645) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,931 INFO L895 garLoopResultBuilder]: At program point L1064(line 1064) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,932 INFO L899 garLoopResultBuilder]: For program point L1064-1(line 1064) no Hoare annotation was computed. [2023-11-06 22:22:48,932 INFO L895 garLoopResultBuilder]: At program point dev_set_drvdata_returnLabel#1(lines 1469 1471) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,932 INFO L899 garLoopResultBuilder]: For program point L1122(line 1122) no Hoare annotation was computed. [2023-11-06 22:22:48,932 INFO L895 garLoopResultBuilder]: At program point L833(line 833) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,932 INFO L895 garLoopResultBuilder]: At program point L1089(line 1089) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,932 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2023-11-06 22:22:48,933 INFO L899 garLoopResultBuilder]: For program point L833-1(line 833) no Hoare annotation was computed. [2023-11-06 22:22:48,933 INFO L899 garLoopResultBuilder]: For program point L1089-1(line 1089) no Hoare annotation was computed. [2023-11-06 22:22:48,933 INFO L895 garLoopResultBuilder]: At program point L1023(line 1023) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,933 INFO L895 garLoopResultBuilder]: At program point L1023-1(line 1023) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,934 INFO L895 garLoopResultBuilder]: At program point hwmon_device_register_returnLabel#1(lines 1479 1481) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,934 INFO L895 garLoopResultBuilder]: At program point ldv_10012(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,934 INFO L895 garLoopResultBuilder]: At program point L1015-1(line 1015) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,934 INFO L895 garLoopResultBuilder]: At program point L1073(line 1073) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,934 INFO L899 garLoopResultBuilder]: For program point L1073-1(line 1073) no Hoare annotation was computed. [2023-11-06 22:22:48,935 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1053 1148) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (or (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483645)) (= |s3c_hwmon_probe_~i~0#1| 0)) (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,935 INFO L895 garLoopResultBuilder]: At program point L1090(line 1090) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,935 INFO L895 garLoopResultBuilder]: At program point L1057(line 1057) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,935 INFO L899 garLoopResultBuilder]: For program point L1090-1(line 1090) no Hoare annotation was computed. [2023-11-06 22:22:48,935 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_create_attr_returnLabel#1(lines 996 1031) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,935 INFO L899 garLoopResultBuilder]: For program point L1057-1(line 1057) no Hoare annotation was computed. [2023-11-06 22:22:48,936 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2023-11-06 22:22:48,936 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 1130) no Hoare annotation was computed. [2023-11-06 22:22:48,936 INFO L899 garLoopResultBuilder]: For program point L1082(lines 1082 1085) no Hoare annotation was computed. [2023-11-06 22:22:48,936 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,936 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2023-11-06 22:22:48,936 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1080) no Hoare annotation was computed. [2023-11-06 22:22:48,937 INFO L895 garLoopResultBuilder]: At program point dev_warn_returnLabel#1(lines 1473 1475) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,937 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2023-11-06 22:22:48,937 INFO L899 garLoopResultBuilder]: For program point L1132(line 1132) no Hoare annotation was computed. [2023-11-06 22:22:48,937 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1102) no Hoare annotation was computed. [2023-11-06 22:22:48,937 INFO L895 garLoopResultBuilder]: At program point L835(line 835) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,937 INFO L895 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,938 INFO L895 garLoopResultBuilder]: At program point L1116(lines 1116 1117) the Hoare annotation is: (let ((.cse0 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse1 (= ~ldv_count_2~0 0))) (or (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse1) (not (= ~ldv_state_variable_0~0 2)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,938 INFO L899 garLoopResultBuilder]: For program point L1116-1(lines 1116 1117) no Hoare annotation was computed. [2023-11-06 22:22:48,938 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_7_returnLabel#1(lines 1340 1347) the Hoare annotation is: (let ((.cse0 (= 0 |s3c_hwmon_probe_~ret~3#1|)) (.cse1 (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0)) (.cse2 (= ~ldv_count_2~0 0))) (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) .cse0 .cse1 (<= |s3c_hwmon_probe_~i~0#1| 2147483645) .cse2) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1 .cse2) (< 0 ~ldv_count_1~0))) [2023-11-06 22:22:48,938 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2023-11-06 22:22:48,938 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_add_raw_returnLabel#1(lines 934 939) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,939 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1053 1148) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ref_cnt~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,939 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1112) no Hoare annotation was computed. [2023-11-06 22:22:48,939 INFO L895 garLoopResultBuilder]: At program point L1075(line 1075) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,939 INFO L899 garLoopResultBuilder]: For program point L1075-1(line 1075) no Hoare annotation was computed. [2023-11-06 22:22:48,939 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 1013) no Hoare annotation was computed. [2023-11-06 22:22:48,939 INFO L899 garLoopResultBuilder]: For program point L1513(lines 1513 1515) no Hoare annotation was computed. [2023-11-06 22:22:48,940 INFO L895 garLoopResultBuilder]: At program point L1480(line 1480) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= |s3c_hwmon_probe_s3c_hwmon_add_raw_#res#1| 0) (= ~ldv_count_2~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,940 INFO L899 garLoopResultBuilder]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2023-11-06 22:22:48,940 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2023-11-06 22:22:48,940 INFO L895 garLoopResultBuilder]: At program point L836-1(line 836) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (and (= 0 |s3c_hwmon_probe_~ret~3#1|) (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,940 INFO L899 garLoopResultBuilder]: For program point L836-2(line 836) no Hoare annotation was computed. [2023-11-06 22:22:48,940 INFO L902 garLoopResultBuilder]: At program point dev_get_drvdata_returnLabel#1(lines 1462 1464) the Hoare annotation is: true [2023-11-06 22:22:48,940 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 895 902) no Hoare annotation was computed. [2023-11-06 22:22:48,941 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 895 902) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,941 INFO L895 garLoopResultBuilder]: At program point L1463(line 1463) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,941 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 895 902) no Hoare annotation was computed. [2023-11-06 22:22:48,941 INFO L899 garLoopResultBuilder]: For program point L1463-1(line 1463) no Hoare annotation was computed. [2023-11-06 22:22:48,941 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 860 867) no Hoare annotation was computed. [2023-11-06 22:22:48,941 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 860 867) the Hoare annotation is: true [2023-11-06 22:22:48,942 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 860 867) no Hoare annotation was computed. [2023-11-06 22:22:48,942 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1482 1484) no Hoare annotation was computed. [2023-11-06 22:22:48,942 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1482 1484) the Hoare annotation is: true [2023-11-06 22:22:48,942 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1482 1484) no Hoare annotation was computed. [2023-11-06 22:22:48,942 INFO L899 garLoopResultBuilder]: For program point dev_errFINAL(lines 1459 1461) no Hoare annotation was computed. [2023-11-06 22:22:48,942 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 1459 1461) no Hoare annotation was computed. [2023-11-06 22:22:48,942 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1459 1461) the Hoare annotation is: true [2023-11-06 22:22:48,943 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 876 882) the Hoare annotation is: true [2023-11-06 22:22:48,943 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 876 882) no Hoare annotation was computed. [2023-11-06 22:22:48,943 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:22:48,943 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= |#memory_int| |old(#memory_int)|) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= ~ldv_count_2~0 0)) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,943 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:22:48,943 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1509 1511) no Hoare annotation was computed. [2023-11-06 22:22:48,943 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1509 1511) the Hoare annotation is: true [2023-11-06 22:22:48,944 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1509 1511) no Hoare annotation was computed. [2023-11-06 22:22:48,944 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2023-11-06 22:22:48,944 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2023-11-06 22:22:48,944 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 800 802) the Hoare annotation is: true [2023-11-06 22:22:48,944 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2023-11-06 22:22:48,944 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeFINAL(lines 1150 1173) no Hoare annotation was computed. [2023-11-06 22:22:48,945 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeEXIT(lines 1150 1173) no Hoare annotation was computed. [2023-11-06 22:22:48,945 INFO L895 garLoopResultBuilder]: At program point L1170(line 1170) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,945 INFO L895 garLoopResultBuilder]: At program point L1169(line 1169) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,945 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2023-11-06 22:22:48,945 INFO L899 garLoopResultBuilder]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2023-11-06 22:22:48,945 INFO L895 garLoopResultBuilder]: At program point ldv_10022(lines 1155 1172) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (and (<= s3c_hwmon_remove_~i~1 2147483645) (<= 1 s3c_hwmon_remove_~i~1)) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,946 INFO L899 garLoopResultBuilder]: For program point L1163(line 1163) no Hoare annotation was computed. [2023-11-06 22:22:48,946 INFO L899 garLoopResultBuilder]: For program point L1162(line 1162) no Hoare annotation was computed. [2023-11-06 22:22:48,946 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1150 1173) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,946 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2023-11-06 22:22:48,946 INFO L902 garLoopResultBuilder]: At program point L1158(line 1158) the Hoare annotation is: true [2023-11-06 22:22:48,946 INFO L899 garLoopResultBuilder]: For program point L1158-1(line 1158) no Hoare annotation was computed. [2023-11-06 22:22:48,947 INFO L895 garLoopResultBuilder]: At program point L1156(line 1156) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,947 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2023-11-06 22:22:48,947 INFO L899 garLoopResultBuilder]: For program point L1156-1(line 1156) no Hoare annotation was computed. [2023-11-06 22:22:48,947 INFO L895 garLoopResultBuilder]: At program point $Ultimate##2(lines 1165 1168) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (= ~ldv_count_2~0 0)) (< 1 ~ref_cnt~0) (< 0 ~ldv_count_1~0) (< ~ref_cnt~0 1)) [2023-11-06 22:22:48,947 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1324 1331) the Hoare annotation is: true [2023-11-06 22:22:48,947 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1324 1331) no Hoare annotation was computed. [2023-11-06 22:22:48,948 INFO L902 garLoopResultBuilder]: At program point ldv_ptr_err_returnLabel#1(lines 1397 1402) the Hoare annotation is: true [2023-11-06 22:22:48,948 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1324 1331) no Hoare annotation was computed. [2023-11-06 22:22:48,948 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1385 1390) no Hoare annotation was computed. [2023-11-06 22:22:48,948 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1385 1390) the Hoare annotation is: true [2023-11-06 22:22:48,948 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1385 1390) no Hoare annotation was computed. [2023-11-06 22:22:48,948 INFO L902 garLoopResultBuilder]: At program point L817(line 817) the Hoare annotation is: true [2023-11-06 22:22:48,949 INFO L902 garLoopResultBuilder]: At program point L818-1(line 818) the Hoare annotation is: true [2023-11-06 22:22:48,949 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2023-11-06 22:22:48,949 INFO L899 garLoopResultBuilder]: For program point L818-2(line 818) no Hoare annotation was computed. [2023-11-06 22:22:48,949 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 820) no Hoare annotation was computed. [2023-11-06 22:22:48,949 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 805 822) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 2))) (.cse1 (not (= ~ldv_count_2~0 0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (< 0 ~ldv_count_1~0))) (and (or .cse0 (< 0 ~probed_1~0) (< ~ref_cnt~0 0) (< 0 ~ref_cnt~0) .cse1 .cse2 .cse3) (or .cse0 (not (= ~ldv_state_variable_1~0 2)) .cse1 .cse2 (< 1 ~ref_cnt~0) .cse3 (< ~ref_cnt~0 1)))) [2023-11-06 22:22:48,949 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 805 822) no Hoare annotation was computed. [2023-11-06 22:22:48,949 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2023-11-06 22:22:48,950 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 805 822) no Hoare annotation was computed. [2023-11-06 22:22:48,950 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1476 1478) the Hoare annotation is: true [2023-11-06 22:22:48,950 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1476 1478) no Hoare annotation was computed. [2023-11-06 22:22:48,950 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1476 1478) no Hoare annotation was computed. [2023-11-06 22:22:48,950 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2023-11-06 22:22:48,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2023-11-06 22:22:48,951 INFO L902 garLoopResultBuilder]: At program point platform_driver_unregister_returnLabel#1(lines 1499 1501) the Hoare annotation is: true [2023-11-06 22:22:48,951 INFO L899 garLoopResultBuilder]: For program point L1307(line 1307) no Hoare annotation was computed. [2023-11-06 22:22:48,951 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 1449 1454) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,951 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2023-11-06 22:22:48,951 INFO L899 garLoopResultBuilder]: For program point L1291(lines 1291 1305) no Hoare annotation was computed. [2023-11-06 22:22:48,951 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1220 1323) the Hoare annotation is: true [2023-11-06 22:22:48,951 INFO L899 garLoopResultBuilder]: For program point L1283(lines 1283 1288) no Hoare annotation was computed. [2023-11-06 22:22:48,952 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1259) no Hoare annotation was computed. [2023-11-06 22:22:48,952 INFO L899 garLoopResultBuilder]: For program point L1250-1(lines 1236 1273) no Hoare annotation was computed. [2023-11-06 22:22:48,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2023-11-06 22:22:48,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:22:48,952 INFO L902 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: true [2023-11-06 22:22:48,952 INFO L899 garLoopResultBuilder]: For program point L1242(line 1242) no Hoare annotation was computed. [2023-11-06 22:22:48,953 INFO L899 garLoopResultBuilder]: For program point L1242-1(line 1242) no Hoare annotation was computed. [2023-11-06 22:22:48,953 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1276) no Hoare annotation was computed. [2023-11-06 22:22:48,953 INFO L895 garLoopResultBuilder]: At program point L1251(line 1251) the Hoare annotation is: false [2023-11-06 22:22:48,953 INFO L899 garLoopResultBuilder]: For program point L1251-1(line 1251) no Hoare annotation was computed. [2023-11-06 22:22:48,953 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2023-11-06 22:22:48,953 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2023-11-06 22:22:48,953 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:22:48,954 INFO L899 garLoopResultBuilder]: For program point L1252(lines 1252 1257) no Hoare annotation was computed. [2023-11-06 22:22:48,954 INFO L902 garLoopResultBuilder]: At program point main_ldv_final#1(lines 1225 1322) the Hoare annotation is: true [2023-11-06 22:22:48,954 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1273) no Hoare annotation was computed. [2023-11-06 22:22:48,954 INFO L895 garLoopResultBuilder]: At program point L1261(line 1261) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 1) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,954 INFO L899 garLoopResultBuilder]: For program point L1261-1(line 1261) no Hoare annotation was computed. [2023-11-06 22:22:48,954 INFO L899 garLoopResultBuilder]: For program point L1278(line 1278) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point L1262(lines 1262 1267) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point L1254(line 1254) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point L1254-1(line 1254) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point L1279(lines 1279 1312) no Hoare annotation was computed. [2023-11-06 22:22:48,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2023-11-06 22:22:48,956 INFO L899 garLoopResultBuilder]: For program point L1271(line 1271) no Hoare annotation was computed. [2023-11-06 22:22:48,956 INFO L899 garLoopResultBuilder]: For program point L1238(lines 1238 1247) no Hoare annotation was computed. [2023-11-06 22:22:48,956 INFO L895 garLoopResultBuilder]: At program point L1230(lines 1225 1322) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse4 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (<= ~probed_1~0 0)) (.cse5 (= ~ldv_state_variable_1~0 0)) (.cse1 (= ~ldv_state_variable_0~0 2))) (or (and .cse0 (= ~ldv_state_variable_1~0 2) .cse1 (= ~ref_cnt~0 1) .cse2) (and .cse0 .cse3 .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5 .cse4 .cse2) (and .cse3 .cse5 .cse1))) [2023-11-06 22:22:48,956 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:22:48,956 INFO L895 garLoopResultBuilder]: At program point L1214(line 1214) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,956 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2023-11-06 22:22:48,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2023-11-06 22:22:48,957 INFO L902 garLoopResultBuilder]: At program point L1272(line 1272) the Hoare annotation is: true [2023-11-06 22:22:48,957 INFO L895 garLoopResultBuilder]: At program point L1239(line 1239) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,957 INFO L899 garLoopResultBuilder]: For program point L1239-1(line 1239) no Hoare annotation was computed. [2023-11-06 22:22:48,957 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_init_returnLabel#1(lines 1177 1184) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,957 INFO L899 garLoopResultBuilder]: For program point L1264(line 1264) no Hoare annotation was computed. [2023-11-06 22:22:48,958 INFO L899 garLoopResultBuilder]: For program point L1264-1(line 1264) no Hoare annotation was computed. [2023-11-06 22:22:48,958 INFO L899 garLoopResultBuilder]: For program point L1314(line 1314) no Hoare annotation was computed. [2023-11-06 22:22:48,958 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1309) no Hoare annotation was computed. [2023-11-06 22:22:48,958 INFO L895 garLoopResultBuilder]: At program point platform_driver_register_returnLabel#1(lines 1496 1498) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,958 INFO L895 garLoopResultBuilder]: At program point L1215(line 1215) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,958 INFO L895 garLoopResultBuilder]: At program point ldv_platform_driver_init_1_returnLabel#1(lines 1210 1219) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2023-11-06 22:22:48,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2023-11-06 22:22:48,959 INFO L899 garLoopResultBuilder]: For program point L1215-1(line 1215) no Hoare annotation was computed. [2023-11-06 22:22:48,959 INFO L899 garLoopResultBuilder]: For program point L1240(lines 1240 1245) no Hoare annotation was computed. [2023-11-06 22:22:48,959 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_exit_returnLabel#1(lines 1185 1191) the Hoare annotation is: true [2023-11-06 22:22:48,959 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1303) no Hoare annotation was computed. [2023-11-06 22:22:48,959 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 1316) no Hoare annotation was computed. [2023-11-06 22:22:48,959 INFO L899 garLoopResultBuilder]: For program point L1290(line 1290) no Hoare annotation was computed. [2023-11-06 22:22:48,960 INFO L902 garLoopResultBuilder]: At program point L1315(line 1315) the Hoare annotation is: true [2023-11-06 22:22:48,960 INFO L902 garLoopResultBuilder]: At program point ldv_check_final_state_returnLabel#1(lines 1485 1487) the Hoare annotation is: true [2023-11-06 22:22:48,960 INFO L899 garLoopResultBuilder]: For program point L1282(line 1282) no Hoare annotation was computed. [2023-11-06 22:22:48,960 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1032 1039) no Hoare annotation was computed. [2023-11-06 22:22:48,960 INFO L902 garLoopResultBuilder]: At program point L1035(line 1035) the Hoare annotation is: true [2023-11-06 22:22:48,960 INFO L902 garLoopResultBuilder]: At program point L1035-1(line 1035) the Hoare annotation is: true [2023-11-06 22:22:48,960 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1032 1039) no Hoare annotation was computed. [2023-11-06 22:22:48,961 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1032 1039) the Hoare annotation is: true [2023-11-06 22:22:48,961 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2023-11-06 22:22:48,961 INFO L899 garLoopResultBuilder]: For program point L1437(line 1437) no Hoare annotation was computed. [2023-11-06 22:22:48,961 INFO L899 garLoopResultBuilder]: For program point L1437-1(line 1437) no Hoare annotation was computed. [2023-11-06 22:22:48,961 INFO L895 garLoopResultBuilder]: At program point L1435(line 1435) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,961 INFO L899 garLoopResultBuilder]: For program point L1435-1(line 1435) no Hoare annotation was computed. [2023-11-06 22:22:48,962 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileFINAL(lines 1430 1448) no Hoare annotation was computed. [2023-11-06 22:22:48,962 INFO L899 garLoopResultBuilder]: For program point L1367(line 1367) no Hoare annotation was computed. [2023-11-06 22:22:48,962 INFO L895 garLoopResultBuilder]: At program point ldv_undef_int_negative_returnLabel#1(lines 1371 1384) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,962 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1430 1448) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,962 INFO L899 garLoopResultBuilder]: For program point L1378(lines 1378 1381) no Hoare annotation was computed. [2023-11-06 22:22:48,962 INFO L899 garLoopResultBuilder]: For program point L1378-1(lines 1378 1381) no Hoare annotation was computed. [2023-11-06 22:22:48,962 INFO L895 garLoopResultBuilder]: At program point L1376(line 1376) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (= ~ldv_count_2~0 0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,963 INFO L899 garLoopResultBuilder]: For program point L1376-1(line 1376) no Hoare annotation was computed. [2023-11-06 22:22:48,963 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2023-11-06 22:22:48,963 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2023-11-06 22:22:48,963 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileEXIT(lines 1430 1448) no Hoare annotation was computed. [2023-11-06 22:22:48,963 INFO L899 garLoopResultBuilder]: For program point L1436(lines 1436 1446) no Hoare annotation was computed. [2023-11-06 22:22:48,963 INFO L899 garLoopResultBuilder]: For program point L1438-2(lines 1438 1441) no Hoare annotation was computed. [2023-11-06 22:22:48,964 INFO L899 garLoopResultBuilder]: For program point L1364(lines 1364 1370) no Hoare annotation was computed. [2023-11-06 22:22:48,964 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-11-06 22:22:48,964 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2023-11-06 22:22:48,964 INFO L895 garLoopResultBuilder]: At program point L1379(line 1379) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (< 0 ~probed_1~0) (not (= |old(~ldv_count_2~0)| 0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (< 0 ~ldv_count_1~0)) [2023-11-06 22:22:48,964 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1332 1339) no Hoare annotation was computed. [2023-11-06 22:22:48,964 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1332 1339) the Hoare annotation is: true [2023-11-06 22:22:48,964 INFO L902 garLoopResultBuilder]: At program point L1336(line 1336) the Hoare annotation is: true [2023-11-06 22:22:48,965 INFO L899 garLoopResultBuilder]: For program point L1336-1(line 1336) no Hoare annotation was computed. [2023-11-06 22:22:48,965 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1332 1339) no Hoare annotation was computed. [2023-11-06 22:22:48,968 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:48,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:22:49,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:22:49 BoogieIcfgContainer [2023-11-06 22:22:49,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:22:49,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:22:49,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:22:49,009 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:22:49,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:15" (3/4) ... [2023-11-06 22:22:49,012 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:22:49,016 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2023-11-06 22:22:49,016 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-06 22:22:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-06 22:22:49,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-06 22:22:49,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-06 22:22:49,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2023-11-06 22:22:49,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2023-11-06 22:22:49,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2023-11-06 22:22:49,018 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2023-11-06 22:22:49,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2023-11-06 22:22:49,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2023-11-06 22:22:49,036 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2023-11-06 22:22:49,038 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-06 22:22:49,039 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-06 22:22:49,041 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 22:22:49,043 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:22:49,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((\result == 0) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,075 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (ldv_count_2 == 0)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,076 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((\result == 0) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,076 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || (((\result == 0) && (i <= 2147483645)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((\result == 0) && (i <= 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((((0 <= i) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,077 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,101 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((((((1 <= i) && (i <= 2147483645)) || (i == 0)) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,101 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,101 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (((0 == ret) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,102 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!((ldv_state_variable_0 == 2)) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (i <= 2147483646)) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ref_cnt)) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,102 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,102 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (((0 == ret) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,106 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (ldv_count_2 == 0)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,106 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,106 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,221 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((\result == 0) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,221 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (ldv_count_2 == 0)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,222 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((\result == 0) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,224 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || (((\result == 0) && (i <= 2147483645)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,227 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((\result == 0) && (i <= 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,227 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((((0 <= i) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,227 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,227 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || ((((((1 <= i) && (i <= 2147483645)) || (i == 0)) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,227 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,228 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (((0 == ret) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,228 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!((ldv_state_variable_0 == 2)) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (i <= 2147483646)) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ref_cnt)) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,229 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,229 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,229 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,229 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (((0 == ret) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (ldv_count_2 == 0)) || (0 < ldv_count_1)) [2023-11-06 22:22:49,230 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,231 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) [2023-11-06 22:22:49,251 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:22:49,251 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:22:49,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:22:49,252 INFO L158 Benchmark]: Toolchain (without parser) took 35939.85ms. Allocated memory was 146.8MB in the beginning and 539.0MB in the end (delta: 392.2MB). Free memory was 102.8MB in the beginning and 486.4MB in the end (delta: -383.6MB). Peak memory consumption was 318.8MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,253 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 109.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:49,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.15ms. Allocated memory is still 146.8MB. Free memory was 102.8MB in the beginning and 71.8MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.99ms. Allocated memory is still 146.8MB. Free memory was 71.8MB in the beginning and 115.1MB in the end (delta: -43.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,254 INFO L158 Benchmark]: Boogie Preprocessor took 94.59ms. Allocated memory is still 146.8MB. Free memory was 115.1MB in the beginning and 110.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,254 INFO L158 Benchmark]: RCFGBuilder took 1127.05ms. Allocated memory is still 146.8MB. Free memory was 110.5MB in the beginning and 62.9MB in the end (delta: 47.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,255 INFO L158 Benchmark]: TraceAbstraction took 33538.29ms. Allocated memory was 146.8MB in the beginning and 539.0MB in the end (delta: 392.2MB). Free memory was 62.3MB in the beginning and 183.4MB in the end (delta: -121.2MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,255 INFO L158 Benchmark]: Witness Printer took 242.69ms. Allocated memory is still 539.0MB. Free memory was 183.4MB in the beginning and 486.4MB in the end (delta: -303.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:22:49,257 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.49ms. Allocated memory is still 109.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 813.15ms. Allocated memory is still 146.8MB. Free memory was 102.8MB in the beginning and 71.8MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.99ms. Allocated memory is still 146.8MB. Free memory was 71.8MB in the beginning and 115.1MB in the end (delta: -43.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.59ms. Allocated memory is still 146.8MB. Free memory was 115.1MB in the beginning and 110.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1127.05ms. Allocated memory is still 146.8MB. Free memory was 110.5MB in the beginning and 62.9MB in the end (delta: 47.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 33538.29ms. Allocated memory was 146.8MB in the beginning and 539.0MB in the end (delta: 392.2MB). Free memory was 62.3MB in the beginning and 183.4MB in the end (delta: -121.2MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. * Witness Printer took 242.69ms. Allocated memory is still 539.0MB. Free memory was 183.4MB in the beginning and 486.4MB in the end (delta: -303.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 258 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4559 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4249 mSDsluCounter, 12102 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7402 mSDsCounter, 1559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3762 IncrementalHoareTripleChecker+Invalid, 5321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1559 mSolverCounterUnsat, 4700 mSDtfsCounter, 3762 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1931 GetRequests, 1819 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1493occurred in iteration=11, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 1997 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 101 LocationsWithAnnotation, 3891 PreInvPairs, 4126 NumberOfFragments, 2256 HoareAnnotationTreeSize, 3891 FomulaSimplifications, 154923 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 101 FomulaSimplificationsInter, 28718 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2831 NumberOfCodeBlocks, 2831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3162 ConstructedInterpolants, 0 QuantifiedInterpolants, 5879 SizeOfPredicates, 3 NumberOfNonLiveVariables, 7315 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 31 InterpolantComputations, 15 PerfectInterpolantSequences, 816/895 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 16 specifications checked. All of them hold - InvariantResult [Line: 1371]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (ldv_count_2 == 0)) || (0 < ldv_count_1)) - InvariantResult [Line: 1499]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1177]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (ldv_count_2 == 0)) || (0 < ldv_count_1)) - InvariantResult [Line: 1469]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1479]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (((0 == ret) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || ((((0 <= i) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1210]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1506]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: ((((((((ldv_count_1 <= 0) && (ldv_state_variable_1 == 2)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 1)) && (ldv_count_2 == 0)) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_0 == 2)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) || (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) && (ldv_count_2 == 0))) || (((probed_1 <= 0) && (ldv_state_variable_1 == 0)) && (ldv_state_variable_0 == 2))) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || ((((((1 <= i) && (i <= 2147483645)) || (i == 0)) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: (((((((!((ldv_state_variable_0 == 2)) || (i == 0)) || !((ldv_state_variable_1 == 2))) || !((ldv_count_2 == 0))) || (1 < ref_cnt)) || (0 < ldv_count_1)) || ((i <= 2147483645) && (1 <= i))) || (ref_cnt < 1)) - InvariantResult [Line: 1134]: Loop Invariant Derived loop invariant: (((((((!((ldv_state_variable_0 == 2)) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (i <= 2147483646)) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ref_cnt)) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1165]: Loop Invariant Derived loop invariant: (((((((!((ldv_state_variable_0 == 2)) || (i == 0)) || ((1 <= i) && (i <= 2147483646))) || !((ldv_state_variable_1 == 2))) || !((ldv_count_2 == 0))) || (1 < ref_cnt)) || (0 < ldv_count_1)) || (ref_cnt < 1)) - InvariantResult [Line: 1496]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1356]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || (((\result == 0) && (i <= 2147483645)) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1473]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1340]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (((0 == ret) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || ((\result == 0) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || ((\result == 0) && (ldv_count_2 == 0))) || (0 < probed_1)) || (ref_cnt < 0)) || !((\old(ldv_count_2) == 0))) || (0 < ref_cnt)) || (0 < ldv_count_1)) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((\result == 0) && (i <= 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || (((((1 <= i) && (0 == ret)) && (\result == 0)) && (i <= 2147483645)) && (ldv_count_2 == 0))) || ((((i == 0) && (0 == ret)) && (\result == 0)) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1462]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1455]: Loop Invariant Derived loop invariant: (((((!((ldv_state_variable_0 == 2)) || !((ref_cnt == 0))) || (0 < probed_1)) || !((\old(ldv_count_2) == 0))) || ((0 == ret) && (ldv_count_2 == 0))) || (0 < ldv_count_1)) - InvariantResult [Line: 1449]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0) && (probed_1 <= 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) && (ldv_count_2 == 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:22:49,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_593c7d87-ddf5-4ee4-a9d3-bbc2dabb1940/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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