./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 6b4ec56b 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_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/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_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:12:26,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:12:26,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:12:26,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:12:26,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:12:26,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:12:26,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:12:26,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:12:26,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:12:26,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:12:26,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:12:26,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:12:26,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:12:26,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:12:26,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:12:26,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:12:26,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:12:26,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:12:26,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:12:26,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:12:26,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:12:26,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:12:26,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:12:26,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:12:26,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:12:26,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:12:26,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:12:26,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:12:26,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:12:26,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:12:26,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:12:26,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:12:26,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:12:26,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:12:26,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:12:26,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:12:26,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:12:26,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:12:26,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:12:26,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:12:26,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:12:26,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 12:12:26,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:12:26,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:12:26,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:12:26,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:12:26,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:12:26,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:12:26,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:12:26,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:12:26,957 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:12:26,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:12:26,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:12:26,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:12:26,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:12:26,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:12:26,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:12:26,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:12:26,959 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 12:12:26,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:12:26,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:12:26,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:12:26,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:12:26,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:12:26,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:12:26,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:12:26,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:12:26,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:12:26,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:12:26,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:12:26,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:12:26,961 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:12:26,961 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:12:26,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:12:26,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/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_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 12:12:27,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:12:27,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:12:27,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:12:27,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:12:27,241 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:12:27,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/../../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 [2022-11-20 12:12:30,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:12:30,541 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:12:30,542 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/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 [2022-11-20 12:12:30,577 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/data/b75511c77/0a20d2ba4ef9414ebc9e03275a3ef40d/FLAG25eeaeba0 [2022-11-20 12:12:30,597 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/data/b75511c77/0a20d2ba4ef9414ebc9e03275a3ef40d [2022-11-20 12:12:30,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:12:30,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:12:30,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:12:30,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:12:30,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:12:30,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:30" (1/1) ... [2022-11-20 12:12:30,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f314d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:30, skipping insertion in model container [2022-11-20 12:12:30,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:12:30" (1/1) ... [2022-11-20 12:12:30,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:12:30,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:12:31,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/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[37767,37780] [2022-11-20 12:12:31,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:12:31,297 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:12:31,430 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/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[37767,37780] [2022-11-20 12:12:31,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:12:31,461 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:12:31,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31 WrapperNode [2022-11-20 12:12:31,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:12:31,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:12:31,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:12:31,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:12:31,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,542 INFO L138 Inliner]: procedures = 83, calls = 168, calls flagged for inlining = 31, calls inlined = 25, statements flattened = 527 [2022-11-20 12:12:31,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:12:31,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:12:31,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:12:31,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:12:31,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,635 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:12:31,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:12:31,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:12:31,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:12:31,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (1/1) ... [2022-11-20 12:12:31,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:12:31,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:31,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:12:31,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:12:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-11-20 12:12:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-11-20 12:12:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2022-11-20 12:12:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2022-11-20 12:12:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:12:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-20 12:12:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-20 12:12:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:12:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:12:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 12:12:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 12:12:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:12:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-20 12:12:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-20 12:12:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:12:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-20 12:12:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-20 12:12:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-20 12:12:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-20 12:12:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 12:12:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 12:12:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-11-20 12:12:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-11-20 12:12:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:12:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 12:12:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-20 12:12:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-20 12:12:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-20 12:12:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-20 12:12:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:12:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-11-20 12:12:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-11-20 12:12:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 12:12:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 12:12:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:12:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2022-11-20 12:12:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2022-11-20 12:12:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:12:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-20 12:12:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-20 12:12:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:12:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:12:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2022-11-20 12:12:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2022-11-20 12:12:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-20 12:12:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-20 12:12:31,957 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:12:31,960 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:12:32,471 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 12:12:32,753 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:12:32,765 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:12:32,765 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:12:32,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:32 BoogieIcfgContainer [2022-11-20 12:12:32,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:12:32,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:12:32,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:12:32,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:12:32,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:12:30" (1/3) ... [2022-11-20 12:12:32,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f794003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:32, skipping insertion in model container [2022-11-20 12:12:32,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:12:31" (2/3) ... [2022-11-20 12:12:32,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f794003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:12:32, skipping insertion in model container [2022-11-20 12:12:32,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:32" (3/3) ... [2022-11-20 12:12:32,781 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 [2022-11-20 12:12:32,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:12:32,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-20 12:12:32,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:12:32,893 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;@50d5cd3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:12:32,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 12:12:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 184 states have internal predecessors, (223), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-20 12:12:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:12:32,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:32,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:32,908 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)] === [2022-11-20 12:12:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash 165870401, now seen corresponding path program 1 times [2022-11-20 12:12:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:32,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889695629] [2022-11-20 12:12:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 12:12:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:12:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:33,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889695629] [2022-11-20 12:12:33,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889695629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:33,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:33,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:12:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650634904] [2022-11-20 12:12:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:33,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:12:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:12:33,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:12:33,304 INFO L87 Difference]: Start difference. First operand has 236 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 184 states have internal predecessors, (223), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:12:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:34,044 INFO L93 Difference]: Finished difference Result 518 states and 680 transitions. [2022-11-20 12:12:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:12:34,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 12:12:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:34,067 INFO L225 Difference]: With dead ends: 518 [2022-11-20 12:12:34,068 INFO L226 Difference]: Without dead ends: 262 [2022-11-20 12:12:34,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:12:34,084 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 95 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:34,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 532 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:12:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-20 12:12:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2022-11-20 12:12:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 171 states have (on average 1.345029239766082) internal successors, (230), 187 states have internal predecessors, (230), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-20 12:12:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2022-11-20 12:12:34,156 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 16 [2022-11-20 12:12:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:34,157 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2022-11-20 12:12:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:12:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-11-20 12:12:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:12:34,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:34,159 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] [2022-11-20 12:12:34,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:12:34,160 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)] === [2022-11-20 12:12:34,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash -11803947, now seen corresponding path program 1 times [2022-11-20 12:12:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:34,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864206736] [2022-11-20 12:12:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:12:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:34,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864206736] [2022-11-20 12:12:34,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864206736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:34,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:34,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:12:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937209361] [2022-11-20 12:12:34,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:34,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:12:34,444 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:12:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:35,345 INFO L93 Difference]: Finished difference Result 521 states and 667 transitions. [2022-11-20 12:12:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-20 12:12:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:35,350 INFO L225 Difference]: With dead ends: 521 [2022-11-20 12:12:35,351 INFO L226 Difference]: Without dead ends: 515 [2022-11-20 12:12:35,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:35,352 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 324 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:35,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 688 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:12:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-20 12:12:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 459. [2022-11-20 12:12:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 339 states have (on average 1.3303834808259587) internal successors, (451), 356 states have internal predecessors, (451), 72 states have call successors, (72), 32 states have call predecessors, (72), 32 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-11-20 12:12:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 595 transitions. [2022-11-20 12:12:35,403 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 595 transitions. Word has length 40 [2022-11-20 12:12:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:35,404 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 595 transitions. [2022-11-20 12:12:35,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:12:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 595 transitions. [2022-11-20 12:12:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 12:12:35,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:35,407 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:12:35,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:12:35,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:35,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2035530627, now seen corresponding path program 1 times [2022-11-20 12:12:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:35,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671017922] [2022-11-20 12:12:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:12:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 12:12:35,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:35,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671017922] [2022-11-20 12:12:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671017922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:35,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:35,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:12:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016425356] [2022-11-20 12:12:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:35,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:35,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:12:35,607 INFO L87 Difference]: Start difference. First operand 459 states and 595 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-11-20 12:12:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:36,326 INFO L93 Difference]: Finished difference Result 1167 states and 1505 transitions. [2022-11-20 12:12:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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 54 [2022-11-20 12:12:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:36,334 INFO L225 Difference]: With dead ends: 1167 [2022-11-20 12:12:36,334 INFO L226 Difference]: Without dead ends: 711 [2022-11-20 12:12:36,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:36,340 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 185 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:36,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 729 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:12:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-20 12:12:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 625. [2022-11-20 12:12:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 459 states have (on average 1.3050108932461875) internal successors, (599), 476 states have internal predecessors, (599), 96 states have call successors, (96), 54 states have call predecessors, (96), 54 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-11-20 12:12:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 791 transitions. [2022-11-20 12:12:36,422 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 791 transitions. Word has length 54 [2022-11-20 12:12:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:36,422 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 791 transitions. [2022-11-20 12:12:36,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-11-20 12:12:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 791 transitions. [2022-11-20 12:12:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 12:12:36,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:36,435 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] [2022-11-20 12:12:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:12:36,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash 622072863, now seen corresponding path program 1 times [2022-11-20 12:12:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:36,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909126861] [2022-11-20 12:12:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 12:12:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:12:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 12:12:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:12:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:36,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909126861] [2022-11-20 12:12:36,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909126861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:36,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942562932] [2022-11-20 12:12:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:36,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:36,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:36,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:36,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:12:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:36,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:12:37,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:12:37,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:37,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942562932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:37,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:37,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-20 12:12:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941898851] [2022-11-20 12:12:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:37,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:12:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:12:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:12:37,072 INFO L87 Difference]: Start difference. First operand 625 states and 791 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) [2022-11-20 12:12:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:37,154 INFO L93 Difference]: Finished difference Result 1332 states and 1692 transitions. [2022-11-20 12:12:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:12:37,154 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 [2022-11-20 12:12:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:37,158 INFO L225 Difference]: With dead ends: 1332 [2022-11-20 12:12:37,158 INFO L226 Difference]: Without dead ends: 710 [2022-11-20 12:12:37,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 [2022-11-20 12:12:37,171 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 198 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 584 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 [2022-11-20 12:12:37,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 584 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-20 12:12:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2022-11-20 12:12:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 523 states have (on average 1.315487571701721) internal successors, (688), 541 states have internal predecessors, (688), 104 states have call successors, (104), 55 states have call predecessors, (104), 55 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2022-11-20 12:12:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 896 transitions. [2022-11-20 12:12:37,236 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 896 transitions. Word has length 66 [2022-11-20 12:12:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:37,238 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 896 transitions. [2022-11-20 12:12:37,238 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) [2022-11-20 12:12:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2022-11-20 12:12:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-20 12:12:37,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:37,241 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] [2022-11-20 12:12:37,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:37,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:37,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1434225425, now seen corresponding path program 1 times [2022-11-20 12:12:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:37,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118380007] [2022-11-20 12:12:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:12:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:12:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:12:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:37,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118380007] [2022-11-20 12:12:37,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118380007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:37,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:37,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:12:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435865305] [2022-11-20 12:12:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:37,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:12:37,630 INFO L87 Difference]: Start difference. First operand 698 states and 896 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:12:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:38,128 INFO L93 Difference]: Finished difference Result 1270 states and 1646 transitions. [2022-11-20 12:12:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:12:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2022-11-20 12:12:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:38,135 INFO L225 Difference]: With dead ends: 1270 [2022-11-20 12:12:38,135 INFO L226 Difference]: Without dead ends: 764 [2022-11-20 12:12:38,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:38,138 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 124 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:38,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 524 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:12:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-20 12:12:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 706. [2022-11-20 12:12:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 529 states have (on average 1.3119092627599245) internal successors, (694), 547 states have internal predecessors, (694), 106 states have call successors, (106), 55 states have call predecessors, (106), 55 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2022-11-20 12:12:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2022-11-20 12:12:38,195 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 81 [2022-11-20 12:12:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:38,197 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2022-11-20 12:12:38,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:12:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2022-11-20 12:12:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-20 12:12:38,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:38,200 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] [2022-11-20 12:12:38,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:12:38,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash -21740282, now seen corresponding path program 1 times [2022-11-20 12:12:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:38,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354763757] [2022-11-20 12:12:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:12:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:12:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:12:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:38,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:38,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354763757] [2022-11-20 12:12:38,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354763757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:38,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:38,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:12:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887427707] [2022-11-20 12:12:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:38,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:12:38,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:12:38,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:12:38,387 INFO L87 Difference]: Start difference. First operand 706 states and 906 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) [2022-11-20 12:12:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:38,710 INFO L93 Difference]: Finished difference Result 1539 states and 2014 transitions. [2022-11-20 12:12:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:12:38,710 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 [2022-11-20 12:12:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:38,716 INFO L225 Difference]: With dead ends: 1539 [2022-11-20 12:12:38,716 INFO L226 Difference]: Without dead ends: 836 [2022-11-20 12:12:38,718 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 [2022-11-20 12:12:38,720 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 91 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:38,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 548 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:12:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-11-20 12:12:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 784. [2022-11-20 12:12:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 598 states have (on average 1.3210702341137124) internal successors, (790), 616 states have internal predecessors, (790), 115 states have call successors, (115), 55 states have call predecessors, (115), 55 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-11-20 12:12:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1020 transitions. [2022-11-20 12:12:38,774 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1020 transitions. Word has length 84 [2022-11-20 12:12:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:38,774 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 1020 transitions. [2022-11-20 12:12:38,775 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) [2022-11-20 12:12:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1020 transitions. [2022-11-20 12:12:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-20 12:12:38,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:38,776 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, 1, 1, 1, 1, 1, 1] [2022-11-20 12:12:38,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:12:38,777 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1302579183, now seen corresponding path program 2 times [2022-11-20 12:12:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:38,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108527307] [2022-11-20 12:12:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:12:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:12:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:12:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 12:12:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108527307] [2022-11-20 12:12:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108527307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:38,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:38,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:12:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232600815] [2022-11-20 12:12:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:38,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:12:38,948 INFO L87 Difference]: Start difference. First operand 784 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 12:12:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:39,411 INFO L93 Difference]: Finished difference Result 1345 states and 1748 transitions. [2022-11-20 12:12:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:12:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2022-11-20 12:12:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:39,415 INFO L225 Difference]: With dead ends: 1345 [2022-11-20 12:12:39,416 INFO L226 Difference]: Without dead ends: 538 [2022-11-20 12:12:39,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:39,419 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 279 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:39,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 512 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:12:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-20 12:12:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 505. [2022-11-20 12:12:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 378 states have (on average 1.2936507936507937) internal successors, (489), 393 states have internal predecessors, (489), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-11-20 12:12:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 637 transitions. [2022-11-20 12:12:39,454 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 637 transitions. Word has length 78 [2022-11-20 12:12:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:39,456 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 637 transitions. [2022-11-20 12:12:39,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 12:12:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 637 transitions. [2022-11-20 12:12:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 12:12:39,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:39,463 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] [2022-11-20 12:12:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:12:39,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -456742297, now seen corresponding path program 1 times [2022-11-20 12:12:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686528156] [2022-11-20 12:12:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:12:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:12:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:12:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:39,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686528156] [2022-11-20 12:12:39,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686528156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:39,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636645304] [2022-11-20 12:12:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:39,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:39,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:39,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:12:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:39,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:39,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:39,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:12:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:40,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636645304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:12:40,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:12:40,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-20 12:12:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511341815] [2022-11-20 12:12:40,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:12:40,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:12:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:12:40,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:12:40,035 INFO L87 Difference]: Start difference. First operand 505 states and 637 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2022-11-20 12:12:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:40,487 INFO L93 Difference]: Finished difference Result 621 states and 809 transitions. [2022-11-20 12:12:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:12:40,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 89 [2022-11-20 12:12:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:40,491 INFO L225 Difference]: With dead ends: 621 [2022-11-20 12:12:40,491 INFO L226 Difference]: Without dead ends: 617 [2022-11-20 12:12:40,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:12:40,495 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 295 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:40,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 696 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:12:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-20 12:12:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 558. [2022-11-20 12:12:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 426 states have (on average 1.3028169014084507) internal successors, (555), 438 states have internal predecessors, (555), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-11-20 12:12:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 719 transitions. [2022-11-20 12:12:40,536 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 719 transitions. Word has length 89 [2022-11-20 12:12:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:40,536 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 719 transitions. [2022-11-20 12:12:40,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2022-11-20 12:12:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 719 transitions. [2022-11-20 12:12:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 12:12:40,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:40,540 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] [2022-11-20 12:12:40,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 12:12:40,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1274109137, now seen corresponding path program 1 times [2022-11-20 12:12:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:40,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357022575] [2022-11-20 12:12:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:12:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:12:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:12:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:40,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:40,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357022575] [2022-11-20 12:12:40,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357022575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:40,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910076204] [2022-11-20 12:12:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:40,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:40,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:40,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:40,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:12:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:41,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:41,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910076204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:41,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:41,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 12:12:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619750911] [2022-11-20 12:12:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:12:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:12:41,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:41,160 INFO L87 Difference]: Start difference. First operand 558 states and 719 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2022-11-20 12:12:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:41,269 INFO L93 Difference]: Finished difference Result 1096 states and 1418 transitions. [2022-11-20 12:12:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:12:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 90 [2022-11-20 12:12:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:41,273 INFO L225 Difference]: With dead ends: 1096 [2022-11-20 12:12:41,273 INFO L226 Difference]: Without dead ends: 563 [2022-11-20 12:12:41,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:12:41,275 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 57 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:41,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-20 12:12:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 497. [2022-11-20 12:12:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 376 states have (on average 1.2632978723404256) internal successors, (475), 385 states have internal predecessors, (475), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-11-20 12:12:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 623 transitions. [2022-11-20 12:12:41,311 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 623 transitions. Word has length 90 [2022-11-20 12:12:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:41,311 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 623 transitions. [2022-11-20 12:12:41,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2022-11-20 12:12:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 623 transitions. [2022-11-20 12:12:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 12:12:41,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:41,313 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] [2022-11-20 12:12:41,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:41,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1107796325, now seen corresponding path program 1 times [2022-11-20 12:12:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:41,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088553217] [2022-11-20 12:12:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:12:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:12:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 12:12:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 12:12:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088553217] [2022-11-20 12:12:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088553217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733131443] [2022-11-20 12:12:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:41,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:41,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:41,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:41,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:12:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:41,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:12:41,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 12:12:41,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:41,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733131443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:41,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:41,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-20 12:12:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848402750] [2022-11-20 12:12:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:41,967 INFO L87 Difference]: Start difference. First operand 497 states and 623 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:12:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:42,069 INFO L93 Difference]: Finished difference Result 1169 states and 1463 transitions. [2022-11-20 12:12:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2022-11-20 12:12:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:42,073 INFO L225 Difference]: With dead ends: 1169 [2022-11-20 12:12:42,073 INFO L226 Difference]: Without dead ends: 883 [2022-11-20 12:12:42,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:42,075 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 201 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:42,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-11-20 12:12:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 691. [2022-11-20 12:12:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 524 states have (on average 1.2595419847328244) internal successors, (660), 536 states have internal predecessors, (660), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-11-20 12:12:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 869 transitions. [2022-11-20 12:12:42,127 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 869 transitions. Word has length 96 [2022-11-20 12:12:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:42,128 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 869 transitions. [2022-11-20 12:12:42,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:12:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 869 transitions. [2022-11-20 12:12:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 12:12:42,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:42,131 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] [2022-11-20 12:12:42,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 12:12:42,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:12:42,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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)] === [2022-11-20 12:12:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1916421667, now seen corresponding path program 1 times [2022-11-20 12:12:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:42,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443063153] [2022-11-20 12:12:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:12:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:12:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:12:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 12:12:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 12:12:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:42,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443063153] [2022-11-20 12:12:42,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443063153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:42,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:42,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:12:42,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219718306] [2022-11-20 12:12:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:42,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:12:42,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:42,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:12:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:12:42,666 INFO L87 Difference]: Start difference. First operand 691 states and 869 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) [2022-11-20 12:12:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:43,180 INFO L93 Difference]: Finished difference Result 1413 states and 1794 transitions. [2022-11-20 12:12:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:12:43,180 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 [2022-11-20 12:12:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:43,187 INFO L225 Difference]: With dead ends: 1413 [2022-11-20 12:12:43,187 INFO L226 Difference]: Without dead ends: 1411 [2022-11-20 12:12:43,188 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 [2022-11-20 12:12:43,189 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 300 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:43,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 601 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:12:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-20 12:12:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1343. [2022-11-20 12:12:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1019 states have (on average 1.254170755642787) internal successors, (1278), 1036 states have internal predecessors, (1278), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-11-20 12:12:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-11-20 12:12:43,307 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 96 [2022-11-20 12:12:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:43,307 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-11-20 12:12:43,308 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) [2022-11-20 12:12:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-11-20 12:12:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-20 12:12:43,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:43,310 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] [2022-11-20 12:12:43,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:12:43,310 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)] === [2022-11-20 12:12:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1408694220, now seen corresponding path program 1 times [2022-11-20 12:12:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:43,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639939601] [2022-11-20 12:12:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 12:12:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 12:12:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:12:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 12:12:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:43,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639939601] [2022-11-20 12:12:43,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639939601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:43,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205886541] [2022-11-20 12:12:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:43,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:43,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:43,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:43,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:12:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:43,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:12:43,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 12:12:43,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:43,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205886541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:43,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:43,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-20 12:12:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197590817] [2022-11-20 12:12:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:12:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:12:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:43,750 INFO L87 Difference]: Start difference. First operand 1343 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:12:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:43,967 INFO L93 Difference]: Finished difference Result 2695 states and 3414 transitions. [2022-11-20 12:12:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:43,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-11-20 12:12:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:43,978 INFO L225 Difference]: With dead ends: 2695 [2022-11-20 12:12:43,978 INFO L226 Difference]: Without dead ends: 2125 [2022-11-20 12:12:43,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:12:43,981 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 201 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:43,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:43,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2022-11-20 12:12:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1343. [2022-11-20 12:12:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1019 states have (on average 1.254170755642787) internal successors, (1278), 1036 states have internal predecessors, (1278), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-11-20 12:12:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1707 transitions. [2022-11-20 12:12:44,134 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1707 transitions. Word has length 100 [2022-11-20 12:12:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:44,135 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1707 transitions. [2022-11-20 12:12:44,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:12:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1707 transitions. [2022-11-20 12:12:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-20 12:12:44,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:44,137 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] [2022-11-20 12:12:44,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 12:12:44,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:44,344 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)] === [2022-11-20 12:12:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1458291270, now seen corresponding path program 1 times [2022-11-20 12:12:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:44,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835100481] [2022-11-20 12:12:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:12:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:12:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:12:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:12:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:12:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:12:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 12:12:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835100481] [2022-11-20 12:12:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835100481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:44,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:12:44,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:12:44,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440189100] [2022-11-20 12:12:44,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:44,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:12:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:12:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:12:44,817 INFO L87 Difference]: Start difference. First operand 1343 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-20 12:12:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:45,452 INFO L93 Difference]: Finished difference Result 1392 states and 1757 transitions. [2022-11-20 12:12:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:12:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 115 [2022-11-20 12:12:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:45,457 INFO L225 Difference]: With dead ends: 1392 [2022-11-20 12:12:45,457 INFO L226 Difference]: Without dead ends: 708 [2022-11-20 12:12:45,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:12:45,460 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 420 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:45,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 583 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:12:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-11-20 12:12:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 677. [2022-11-20 12:12:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 512 states have (on average 1.248046875) internal successors, (639), 522 states have internal predecessors, (639), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-11-20 12:12:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 848 transitions. [2022-11-20 12:12:45,527 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 848 transitions. Word has length 115 [2022-11-20 12:12:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:45,528 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 848 transitions. [2022-11-20 12:12:45,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-20 12:12:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 848 transitions. [2022-11-20 12:12:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-20 12:12:45,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:45,531 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] [2022-11-20 12:12:45,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:12:45,532 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)] === [2022-11-20 12:12:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2060624510, now seen corresponding path program 1 times [2022-11-20 12:12:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:45,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393523832] [2022-11-20 12:12:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 12:12:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:12:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:12:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 12:12:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 12:12:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 12:12:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:12:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 12:12:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:45,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393523832] [2022-11-20 12:12:45,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393523832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:45,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143131850] [2022-11-20 12:12:45,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:45,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:45,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:45,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:12:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:46,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:46,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 12:12:46,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:12:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 12:12:46,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143131850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:12:46,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:12:46,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-20 12:12:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741193822] [2022-11-20 12:12:46,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:12:46,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:12:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:12:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:46,265 INFO L87 Difference]: Start difference. First operand 677 states and 848 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-20 12:12:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:46,985 INFO L93 Difference]: Finished difference Result 741 states and 941 transitions. [2022-11-20 12:12:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:12:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 129 [2022-11-20 12:12:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:46,990 INFO L225 Difference]: With dead ends: 741 [2022-11-20 12:12:46,990 INFO L226 Difference]: Without dead ends: 740 [2022-11-20 12:12:46,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:12:46,991 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 134 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:46,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 743 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:12:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-20 12:12:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 676. [2022-11-20 12:12:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 512 states have (on average 1.24609375) internal successors, (638), 521 states have internal predecessors, (638), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-11-20 12:12:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 847 transitions. [2022-11-20 12:12:47,059 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 847 transitions. Word has length 129 [2022-11-20 12:12:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:47,060 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 847 transitions. [2022-11-20 12:12:47,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-20 12:12:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 847 transitions. [2022-11-20 12:12:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 12:12:47,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:47,063 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] [2022-11-20 12:12:47,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:47,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 12:12:47,271 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:47,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash -545149392, now seen corresponding path program 1 times [2022-11-20 12:12:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:47,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121125964] [2022-11-20 12:12:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 12:12:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:12:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:12:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 12:12:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 12:12:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 12:12:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:12:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 12:12:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:47,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121125964] [2022-11-20 12:12:47,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121125964] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:47,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821296655] [2022-11-20 12:12:47,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:47,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:47,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:12:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:47,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:47,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 12:12:47,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:47,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821296655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:47,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:47,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 12:12:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851198319] [2022-11-20 12:12:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:47,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:12:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:12:47,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:47,824 INFO L87 Difference]: Start difference. First operand 676 states and 847 transitions. Second operand has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 12:12:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:47,899 INFO L93 Difference]: Finished difference Result 676 states and 847 transitions. [2022-11-20 12:12:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:12:47,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2022-11-20 12:12:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:47,903 INFO L225 Difference]: With dead ends: 676 [2022-11-20 12:12:47,903 INFO L226 Difference]: Without dead ends: 675 [2022-11-20 12:12:47,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:47,904 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:47,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 731 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:12:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-11-20 12:12:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 672. [2022-11-20 12:12:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 510 states have (on average 1.2450980392156863) internal successors, (635), 518 states have internal predecessors, (635), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-11-20 12:12:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 842 transitions. [2022-11-20 12:12:47,966 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 842 transitions. Word has length 130 [2022-11-20 12:12:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:47,967 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 842 transitions. [2022-11-20 12:12:47,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 12:12:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 842 transitions. [2022-11-20 12:12:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-20 12:12:47,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:47,970 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] [2022-11-20 12:12:47,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 12:12:48,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:12:48,177 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1741917965, now seen corresponding path program 1 times [2022-11-20 12:12:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:48,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936338268] [2022-11-20 12:12:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 12:12:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:12:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:12:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:12:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:12:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:12:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:12:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:12:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:12:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:48,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936338268] [2022-11-20 12:12:48,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936338268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:48,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138234504] [2022-11-20 12:12:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:48,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:48,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:12:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:48,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:48,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 12:12:48,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:12:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:12:49,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138234504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:12:49,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:12:49,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-20 12:12:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510602507] [2022-11-20 12:12:49,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:12:49,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:12:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:12:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:12:49,136 INFO L87 Difference]: Start difference. First operand 672 states and 842 transitions. Second operand has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-11-20 12:12:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:49,996 INFO L93 Difference]: Finished difference Result 698 states and 877 transitions. [2022-11-20 12:12:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:12:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2022-11-20 12:12:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:50,000 INFO L225 Difference]: With dead ends: 698 [2022-11-20 12:12:50,000 INFO L226 Difference]: Without dead ends: 696 [2022-11-20 12:12:50,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:12:50,001 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 940 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:50,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 494 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:12:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-20 12:12:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 670. [2022-11-20 12:12:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 510 states have (on average 1.2411764705882353) internal successors, (633), 516 states have internal predecessors, (633), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-11-20 12:12:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2022-11-20 12:12:50,066 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 131 [2022-11-20 12:12:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:50,067 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2022-11-20 12:12:50,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-11-20 12:12:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2022-11-20 12:12:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 12:12:50,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:12:50,070 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] [2022-11-20 12:12:50,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:50,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:12:50,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-20 12:12:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:12:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1835118270, now seen corresponding path program 1 times [2022-11-20 12:12:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:12:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809477796] [2022-11-20 12:12:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:12:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 12:12:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 12:12:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:12:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-20 12:12:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:12:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:12:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:12:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:12:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 12:12:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:12:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:12:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:12:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 12:12:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 12:12:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:12:50,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809477796] [2022-11-20 12:12:50,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809477796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:12:50,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578260838] [2022-11-20 12:12:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:12:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:12:50,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:12:50,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:12:50,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:12:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:12:50,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:12:50,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:12:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 12:12:51,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:12:51,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578260838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:12:51,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:12:51,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 12:12:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076236606] [2022-11-20 12:12:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:12:51,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:12:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:12:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:12:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:51,031 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 12:12:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:12:51,224 INFO L93 Difference]: Finished difference Result 670 states and 840 transitions. [2022-11-20 12:12:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:12:51,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2022-11-20 12:12:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:12:51,225 INFO L225 Difference]: With dead ends: 670 [2022-11-20 12:12:51,226 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:12:51,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:12:51,228 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 212 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:12:51,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 449 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:12:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:12:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:12:51,229 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) [2022-11-20 12:12:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:12:51,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2022-11-20 12:12:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:12:51,229 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:12:51,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 12:12:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:12:51,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:12:51,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-20 12:12:51,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-20 12:12:51,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-20 12:12:51,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-20 12:12:51,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-20 12:12:51,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-20 12:12:51,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-20 12:12:51,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-20 12:12:51,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-20 12:12:51,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-20 12:12:51,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-20 12:12:51,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-20 12:12:51,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-20 12:12:51,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-20 12:12:51,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-20 12:12:51,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-20 12:12:51,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:12:51,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:12:51,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:13:01,239 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 940 945) the Hoare annotation is: true [2022-11-20 12:13:01,240 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 940 945) no Hoare annotation was computed. [2022-11-20 12:13:01,240 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 940 945) no Hoare annotation was computed. [2022-11-20 12:13:01,240 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_probeENTRY(lines 1040 1149) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~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|))) [2022-11-20 12:13:01,240 INFO L895 garLoopResultBuilder]: At program point L1142(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,240 INFO L895 garLoopResultBuilder]: At program point L1076(line 1076) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,240 INFO L899 garLoopResultBuilder]: For program point L1076-1(line 1076) no Hoare annotation was computed. [2022-11-20 12:13:01,241 INFO L895 garLoopResultBuilder]: At program point L1456(lines 1455 1457) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,241 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeFINAL(lines 1040 1149) no Hoare annotation was computed. [2022-11-20 12:13:01,241 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,241 INFO L895 garLoopResultBuilder]: At program point L837(lines 823 840) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,241 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-20 12:13:01,241 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2022-11-20 12:13:01,241 INFO L895 garLoopResultBuilder]: At program point L1135(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,242 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-11-20 12:13:01,242 INFO L895 garLoopResultBuilder]: At program point L937(lines 934 939) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,242 INFO L895 garLoopResultBuilder]: At program point L1507(line 1507) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,242 INFO L899 garLoopResultBuilder]: For program point L1507-1(line 1507) no Hoare annotation was computed. [2022-11-20 12:13:01,242 INFO L895 garLoopResultBuilder]: At program point L1507-2(lines 1506 1508) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,242 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 838) no Hoare annotation was computed. [2022-11-20 12:13:01,242 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-20 12:13:01,242 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,243 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2022-11-20 12:13:01,243 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 1107) no Hoare annotation was computed. [2022-11-20 12:13:01,243 INFO L899 garLoopResultBuilder]: For program point L1103-2(lines 1103 1107) no Hoare annotation was computed. [2022-11-20 12:13:01,243 INFO L895 garLoopResultBuilder]: At program point L1128(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,243 INFO L895 garLoopResultBuilder]: At program point L1029(lines 996 1031) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,243 INFO L895 garLoopResultBuilder]: At program point L1087(line 1087) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,243 INFO L899 garLoopResultBuilder]: For program point L1087-1(line 1087) no Hoare annotation was computed. [2022-11-20 12:13:01,243 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,243 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L895 garLoopResultBuilder]: At program point L1352(line 1352) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1352-1(line 1352) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeEXIT(lines 1040 1149) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1121(line 1121) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1094) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L895 garLoopResultBuilder]: At program point L1344(line 1344) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1344-1(line 1344) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2022-11-20 12:13:01,244 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1028) no Hoare annotation was computed. [2022-11-20 12:13:01,245 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-11-20 12:13:01,245 INFO L899 garLoopResultBuilder]: For program point L1014-1(lines 1014 1028) no Hoare annotation was computed. [2022-11-20 12:13:01,245 INFO L895 garLoopResultBuilder]: At program point L1361(lines 1356 1363) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,245 INFO L895 garLoopResultBuilder]: At program point L907(lines 903 909) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,245 INFO L895 garLoopResultBuilder]: At program point L1353(lines 1348 1355) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,245 INFO L899 garLoopResultBuilder]: For program point L1122(line 1122) no Hoare annotation was computed. [2022-11-20 12:13:01,245 INFO L895 garLoopResultBuilder]: At program point L833(line 833) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,245 INFO L895 garLoopResultBuilder]: At program point L1345(lines 1340 1347) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,245 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2022-11-20 12:13:01,245 INFO L899 garLoopResultBuilder]: For program point L833-1(line 833) no Hoare annotation was computed. [2022-11-20 12:13:01,246 INFO L895 garLoopResultBuilder]: At program point L1023(line 1023) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,246 INFO L899 garLoopResultBuilder]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2022-11-20 12:13:01,246 INFO L895 garLoopResultBuilder]: At program point L1015-1(line 1015) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-11-20 12:13:01,246 INFO L895 garLoopResultBuilder]: At program point L1073(line 1073) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,246 INFO L899 garLoopResultBuilder]: For program point L1073-1(line 1073) no Hoare annotation was computed. [2022-11-20 12:13:01,246 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (and (or (= |s3c_hwmon_probe_~i~0#1| 0) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646))) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,246 INFO L895 garLoopResultBuilder]: At program point L1123(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,246 INFO L895 garLoopResultBuilder]: At program point L1090(line 1090) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1090-1(line 1090) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L895 garLoopResultBuilder]: At program point L1470(lines 1469 1471) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 1130) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1082(lines 1082 1085) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1080) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1132(line 1132) no Hoare annotation was computed. [2022-11-20 12:13:01,247 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1102) no Hoare annotation was computed. [2022-11-20 12:13:01,248 INFO L895 garLoopResultBuilder]: At program point L835(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,248 INFO L895 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,248 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-20 12:13:01,248 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,248 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1112) no Hoare annotation was computed. [2022-11-20 12:13:01,248 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 1013) no Hoare annotation was computed. [2022-11-20 12:13:01,248 INFO L895 garLoopResultBuilder]: At program point L1133(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= ~ref_cnt~0 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)))) [2022-11-20 12:13:01,248 INFO L899 garLoopResultBuilder]: For program point L1513(lines 1513 1515) no Hoare annotation was computed. [2022-11-20 12:13:01,248 INFO L895 garLoopResultBuilder]: At program point L1480(line 1480) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,249 INFO L899 garLoopResultBuilder]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2022-11-20 12:13:01,249 INFO L895 garLoopResultBuilder]: At program point L1480-2(lines 1479 1481) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,249 INFO L895 garLoopResultBuilder]: At program point L1125(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (and (<= 0 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,249 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-11-20 12:13:01,249 INFO L895 garLoopResultBuilder]: At program point L836-1(line 836) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,249 INFO L899 garLoopResultBuilder]: For program point L836-2(line 836) no Hoare annotation was computed. [2022-11-20 12:13:01,249 INFO L895 garLoopResultBuilder]: At program point platform_get_drvdataENTRY(lines 895 902) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,249 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 895 902) no Hoare annotation was computed. [2022-11-20 12:13:01,249 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 (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 895 902) no Hoare annotation was computed. [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point L1463-1(line 1463) no Hoare annotation was computed. [2022-11-20 12:13:01,250 INFO L902 garLoopResultBuilder]: At program point L1463-2(lines 1462 1464) the Hoare annotation is: true [2022-11-20 12:13:01,250 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 860 867) the Hoare annotation is: true [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 860 867) no Hoare annotation was computed. [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 860 867) no Hoare annotation was computed. [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1482 1484) no Hoare annotation was computed. [2022-11-20 12:13:01,250 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1482 1484) the Hoare annotation is: true [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1482 1484) no Hoare annotation was computed. [2022-11-20 12:13:01,250 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 876 882) no Hoare annotation was computed. [2022-11-20 12:13:01,252 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 876 882) the Hoare annotation is: true [2022-11-20 12:13:01,253 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (= |#memory_int| |old(#memory_int)|) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,253 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:13:01,253 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:13:01,253 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1509 1511) the Hoare annotation is: true [2022-11-20 12:13:01,253 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1509 1511) no Hoare annotation was computed. [2022-11-20 12:13:01,253 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1509 1511) no Hoare annotation was computed. [2022-11-20 12:13:01,253 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-11-20 12:13:01,254 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-11-20 12:13:01,254 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-11-20 12:13:01,254 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-11-20 12:13:01,254 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeFINAL(lines 1150 1173) no Hoare annotation was computed. [2022-11-20 12:13:01,254 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeEXIT(lines 1150 1173) no Hoare annotation was computed. [2022-11-20 12:13:01,254 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 (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,255 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 (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,255 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2022-11-20 12:13:01,255 INFO L899 garLoopResultBuilder]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2022-11-20 12:13:01,255 INFO L895 garLoopResultBuilder]: At program point L1166(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 (<= 1 ~ref_cnt~0)) (and (<= 1 s3c_hwmon_remove_~i~1) (< s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,255 INFO L895 garLoopResultBuilder]: At program point L1164(lines 1155 1172) 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 (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,255 INFO L899 garLoopResultBuilder]: For program point L1163(line 1163) no Hoare annotation was computed. [2022-11-20 12:13:01,256 INFO L899 garLoopResultBuilder]: For program point L1162(line 1162) no Hoare annotation was computed. [2022-11-20 12:13:01,256 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_removeENTRY(lines 1150 1173) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,256 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-11-20 12:13:01,256 INFO L902 garLoopResultBuilder]: At program point L1158(line 1158) the Hoare annotation is: true [2022-11-20 12:13:01,256 INFO L899 garLoopResultBuilder]: For program point L1158-1(line 1158) no Hoare annotation was computed. [2022-11-20 12:13:01,256 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 (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-11-20 12:13:01,257 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-11-20 12:13:01,257 INFO L899 garLoopResultBuilder]: For program point L1156-1(line 1156) no Hoare annotation was computed. [2022-11-20 12:13:01,257 INFO L902 garLoopResultBuilder]: At program point L1400(lines 1397 1402) the Hoare annotation is: true [2022-11-20 12:13:01,257 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1324 1331) no Hoare annotation was computed. [2022-11-20 12:13:01,257 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1324 1331) the Hoare annotation is: true [2022-11-20 12:13:01,257 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1324 1331) no Hoare annotation was computed. [2022-11-20 12:13:01,257 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1385 1390) no Hoare annotation was computed. [2022-11-20 12:13:01,258 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1385 1390) the Hoare annotation is: true [2022-11-20 12:13:01,258 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1385 1390) no Hoare annotation was computed. [2022-11-20 12:13:01,258 INFO L902 garLoopResultBuilder]: At program point L817(line 817) the Hoare annotation is: true [2022-11-20 12:13:01,258 INFO L902 garLoopResultBuilder]: At program point L818-1(line 818) the Hoare annotation is: true [2022-11-20 12:13:01,258 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-11-20 12:13:01,258 INFO L899 garLoopResultBuilder]: For program point L818-2(line 818) no Hoare annotation was computed. [2022-11-20 12:13:01,259 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(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 (not (= ~ldv_count_1~0 0)))) (and (or (not (<= ~probed_1~0 0)) .cse0 (not (<= 0 ~ref_cnt~0)) .cse1 .cse2 .cse3 (not (<= ~ref_cnt~0 0))) (or .cse0 (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 .cse3 (not (<= ~ref_cnt~0 1))))) [2022-11-20 12:13:01,259 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 820) no Hoare annotation was computed. [2022-11-20 12:13:01,259 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 805 822) no Hoare annotation was computed. [2022-11-20 12:13:01,259 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2022-11-20 12:13:01,259 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 805 822) no Hoare annotation was computed. [2022-11-20 12:13:01,259 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1476 1478) no Hoare annotation was computed. [2022-11-20 12:13:01,259 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1476 1478) the Hoare annotation is: true [2022-11-20 12:13:01,260 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1476 1478) no Hoare annotation was computed. [2022-11-20 12:13:01,260 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2022-11-20 12:13:01,260 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-11-20 12:13:01,260 INFO L899 garLoopResultBuilder]: For program point L1307(line 1307) no Hoare annotation was computed. [2022-11-20 12:13:01,260 INFO L895 garLoopResultBuilder]: At program point L1497(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)) [2022-11-20 12:13:01,260 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-11-20 12:13:01,261 INFO L899 garLoopResultBuilder]: For program point L1291(lines 1291 1305) no Hoare annotation was computed. [2022-11-20 12:13:01,261 INFO L899 garLoopResultBuilder]: For program point L1283(lines 1283 1288) no Hoare annotation was computed. [2022-11-20 12:13:01,261 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1259) no Hoare annotation was computed. [2022-11-20 12:13:01,261 INFO L899 garLoopResultBuilder]: For program point L1250-1(lines 1236 1273) no Hoare annotation was computed. [2022-11-20 12:13:01,261 INFO L895 garLoopResultBuilder]: At program point L1217(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)) [2022-11-20 12:13:01,261 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-11-20 12:13:01,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:13:01,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:13:01,262 INFO L902 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: true [2022-11-20 12:13:01,262 INFO L899 garLoopResultBuilder]: For program point L1242(line 1242) no Hoare annotation was computed. [2022-11-20 12:13:01,262 INFO L899 garLoopResultBuilder]: For program point L1242-1(line 1242) no Hoare annotation was computed. [2022-11-20 12:13:01,262 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1276) no Hoare annotation was computed. [2022-11-20 12:13:01,262 INFO L895 garLoopResultBuilder]: At program point L1317(lines 1225 1322) the Hoare annotation is: (let ((.cse2 (= ~ldv_state_variable_0~0 2)) (.cse0 (= ~ldv_count_1~0 0)) (.cse1 (<= ~probed_1~0 0)) (.cse4 (= ~ldv_state_variable_1~0 0)) (.cse3 (= ~ldv_count_2~0 0))) (or (and (<= ~ref_cnt~0 0) .cse0 .cse1 (<= 0 ~ref_cnt~0) .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_1~0 2) .cse2 (<= 1 ~ref_cnt~0) .cse3 (<= ~ref_cnt~0 1)) (and .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= ~ref_cnt~0 0) .cse3))) [2022-11-20 12:13:01,263 INFO L895 garLoopResultBuilder]: At program point L1251(line 1251) the Hoare annotation is: false [2022-11-20 12:13:01,263 INFO L899 garLoopResultBuilder]: For program point L1251-1(line 1251) no Hoare annotation was computed. [2022-11-20 12:13:01,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-11-20 12:13:01,263 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2022-11-20 12:13:01,264 INFO L899 garLoopResultBuilder]: For program point L1252(lines 1252 1257) no Hoare annotation was computed. [2022-11-20 12:13:01,264 INFO L902 garLoopResultBuilder]: At program point L1500(lines 1499 1501) the Hoare annotation is: true [2022-11-20 12:13:01,264 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1273) no Hoare annotation was computed. [2022-11-20 12:13:01,264 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) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (<= ~ref_cnt~0 1)) [2022-11-20 12:13:01,264 INFO L899 garLoopResultBuilder]: For program point L1261-1(line 1261) no Hoare annotation was computed. [2022-11-20 12:13:01,264 INFO L899 garLoopResultBuilder]: For program point L1278(line 1278) no Hoare annotation was computed. [2022-11-20 12:13:01,264 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-20 12:13:01,265 INFO L902 garLoopResultBuilder]: At program point L1295(lines 1225 1322) the Hoare annotation is: true [2022-11-20 12:13:01,265 INFO L899 garLoopResultBuilder]: For program point L1262(lines 1262 1267) no Hoare annotation was computed. [2022-11-20 12:13:01,265 INFO L895 garLoopResultBuilder]: At program point L1452(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)) [2022-11-20 12:13:01,265 INFO L899 garLoopResultBuilder]: For program point L1254(line 1254) no Hoare annotation was computed. [2022-11-20 12:13:01,265 INFO L899 garLoopResultBuilder]: For program point L1254-1(line 1254) no Hoare annotation was computed. [2022-11-20 12:13:01,265 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:13:01,266 INFO L899 garLoopResultBuilder]: For program point L1279(lines 1279 1312) no Hoare annotation was computed. [2022-11-20 12:13:01,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-11-20 12:13:01,266 INFO L899 garLoopResultBuilder]: For program point L1271(line 1271) no Hoare annotation was computed. [2022-11-20 12:13:01,266 INFO L899 garLoopResultBuilder]: For program point L1238(lines 1238 1247) no Hoare annotation was computed. [2022-11-20 12:13:01,266 INFO L902 garLoopResultBuilder]: At program point L1486(lines 1485 1487) the Hoare annotation is: true [2022-11-20 12:13:01,266 INFO L902 garLoopResultBuilder]: At program point L1321(lines 1220 1323) the Hoare annotation is: true [2022-11-20 12:13:01,266 INFO L902 garLoopResultBuilder]: At program point L1189(lines 1185 1191) the Hoare annotation is: true [2022-11-20 12:13:01,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:13:01,267 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)) [2022-11-20 12:13:01,267 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2022-11-20 12:13:01,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-11-20 12:13:01,267 INFO L902 garLoopResultBuilder]: At program point L1272(line 1272) the Hoare annotation is: true [2022-11-20 12:13:01,268 INFO L895 garLoopResultBuilder]: At program point L1239(line 1239) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0)) [2022-11-20 12:13:01,268 INFO L899 garLoopResultBuilder]: For program point L1239-1(line 1239) no Hoare annotation was computed. [2022-11-20 12:13:01,268 INFO L899 garLoopResultBuilder]: For program point L1264(line 1264) no Hoare annotation was computed. [2022-11-20 12:13:01,268 INFO L899 garLoopResultBuilder]: For program point L1264-1(line 1264) no Hoare annotation was computed. [2022-11-20 12:13:01,268 INFO L899 garLoopResultBuilder]: For program point L1314(line 1314) no Hoare annotation was computed. [2022-11-20 12:13:01,268 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1309) no Hoare annotation was computed. [2022-11-20 12:13:01,268 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)) [2022-11-20 12:13:01,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-11-20 12:13:01,269 INFO L895 garLoopResultBuilder]: At program point L1182(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)) [2022-11-20 12:13:01,269 INFO L899 garLoopResultBuilder]: For program point L1215-1(line 1215) no Hoare annotation was computed. [2022-11-20 12:13:01,269 INFO L899 garLoopResultBuilder]: For program point L1240(lines 1240 1245) no Hoare annotation was computed. [2022-11-20 12:13:01,269 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1303) no Hoare annotation was computed. [2022-11-20 12:13:01,269 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 1316) no Hoare annotation was computed. [2022-11-20 12:13:01,269 INFO L899 garLoopResultBuilder]: For program point L1290(line 1290) no Hoare annotation was computed. [2022-11-20 12:13:01,270 INFO L902 garLoopResultBuilder]: At program point L1315(line 1315) the Hoare annotation is: true [2022-11-20 12:13:01,270 INFO L899 garLoopResultBuilder]: For program point L1282(line 1282) no Hoare annotation was computed. [2022-11-20 12:13:01,270 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1032 1039) no Hoare annotation was computed. [2022-11-20 12:13:01,270 INFO L902 garLoopResultBuilder]: At program point L1035(line 1035) the Hoare annotation is: true [2022-11-20 12:13:01,270 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1032 1039) the Hoare annotation is: true [2022-11-20 12:13:01,270 INFO L902 garLoopResultBuilder]: At program point L1035-1(line 1035) the Hoare annotation is: true [2022-11-20 12:13:01,270 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1032 1039) no Hoare annotation was computed. [2022-11-20 12:13:01,271 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_fileENTRY(lines 1430 1448) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,271 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-11-20 12:13:01,271 INFO L899 garLoopResultBuilder]: For program point L1437(line 1437) no Hoare annotation was computed. [2022-11-20 12:13:01,271 INFO L899 garLoopResultBuilder]: For program point L1437-1(line 1437) no Hoare annotation was computed. [2022-11-20 12:13:01,271 INFO L895 garLoopResultBuilder]: At program point L1435(line 1435) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,271 INFO L899 garLoopResultBuilder]: For program point L1435-1(line 1435) no Hoare annotation was computed. [2022-11-20 12:13:01,272 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileFINAL(lines 1430 1448) no Hoare annotation was computed. [2022-11-20 12:13:01,272 INFO L899 garLoopResultBuilder]: For program point L1367(line 1367) no Hoare annotation was computed. [2022-11-20 12:13:01,272 INFO L895 garLoopResultBuilder]: At program point L1382(lines 1371 1384) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,272 INFO L899 garLoopResultBuilder]: For program point L1378(lines 1378 1381) no Hoare annotation was computed. [2022-11-20 12:13:01,272 INFO L899 garLoopResultBuilder]: For program point L1378-1(lines 1378 1381) no Hoare annotation was computed. [2022-11-20 12:13:01,272 INFO L895 garLoopResultBuilder]: At program point L1376(line 1376) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point L1376-1(line 1376) no Hoare annotation was computed. [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileEXIT(lines 1430 1448) no Hoare annotation was computed. [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point L1436(lines 1436 1446) no Hoare annotation was computed. [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point L1438-2(lines 1438 1441) no Hoare annotation was computed. [2022-11-20 12:13:01,273 INFO L899 garLoopResultBuilder]: For program point L1364(lines 1364 1370) no Hoare annotation was computed. [2022-11-20 12:13:01,274 INFO L895 garLoopResultBuilder]: At program point L1379(line 1379) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0))) [2022-11-20 12:13:01,274 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1332 1339) the Hoare annotation is: true [2022-11-20 12:13:01,274 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1332 1339) no Hoare annotation was computed. [2022-11-20 12:13:01,274 INFO L902 garLoopResultBuilder]: At program point L1336(line 1336) the Hoare annotation is: true [2022-11-20 12:13:01,274 INFO L899 garLoopResultBuilder]: For program point L1336-1(line 1336) no Hoare annotation was computed. [2022-11-20 12:13:01,274 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1332 1339) no Hoare annotation was computed. [2022-11-20 12:13:01,278 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:13:01,280 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:13:01,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:13:01 BoogieIcfgContainer [2022-11-20 12:13:01,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:13:01,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:13:01,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:13:01,307 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:13:01,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:12:32" (3/4) ... [2022-11-20 12:13:01,311 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:13:01,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-11-20 12:13:01,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_probe [2022-11-20 12:13:01,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 12:13:01,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-20 12:13:01,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-20 12:13:01,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-11-20 12:13:01,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-11-20 12:13:01,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-11-20 12:13:01,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file [2022-11-20 12:13:01,320 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-20 12:13:01,331 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-11-20 12:13:01,332 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-20 12:13:01,333 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-20 12:13:01,334 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:13:01,335 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:13:01,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,365 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0) [2022-11-20 12:13:01,365 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,365 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,366 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,366 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 [2022-11-20 12:13:01,368 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,368 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,368 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0) || !(ref_cnt <= 0) [2022-11-20 12:13:01,369 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) [2022-11-20 12:13:01,453 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:13:01,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:13:01,455 INFO L158 Benchmark]: Toolchain (without parser) took 30849.43ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 148.1MB in the beginning and 209.4MB in the end (delta: -61.2MB). Peak memory consumption was 212.1MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,456 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:13:01,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 852.56ms. Allocated memory is still 180.4MB. Free memory was 148.1MB in the beginning and 126.5MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.63ms. Allocated memory is still 180.4MB. Free memory was 126.5MB in the beginning and 122.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,457 INFO L158 Benchmark]: Boogie Preprocessor took 116.51ms. Allocated memory is still 180.4MB. Free memory was 122.3MB in the beginning and 118.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,458 INFO L158 Benchmark]: RCFGBuilder took 1107.73ms. Allocated memory is still 180.4MB. Free memory was 118.8MB in the beginning and 75.0MB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,458 INFO L158 Benchmark]: TraceAbstraction took 28534.88ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 74.1MB in the beginning and 221.9MB in the end (delta: -147.8MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,459 INFO L158 Benchmark]: Witness Printer took 147.00ms. Allocated memory is still 453.0MB. Free memory was 220.9MB in the beginning and 209.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 12:13:01,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 852.56ms. Allocated memory is still 180.4MB. Free memory was 148.1MB in the beginning and 126.5MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.63ms. Allocated memory is still 180.4MB. Free memory was 126.5MB in the beginning and 122.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.51ms. Allocated memory is still 180.4MB. Free memory was 122.3MB in the beginning and 118.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1107.73ms. Allocated memory is still 180.4MB. Free memory was 118.8MB in the beginning and 75.0MB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28534.88ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 74.1MB in the beginning and 221.9MB in the end (delta: -147.8MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. * Witness Printer took 147.00ms. Allocated memory is still 453.0MB. Free memory was 220.9MB in the beginning and 209.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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 18 procedures, 237 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4283 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4060 mSDsluCounter, 11615 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7406 mSDsCounter, 1376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3838 IncrementalHoareTripleChecker+Invalid, 5214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1376 mSolverCounterUnsat, 4209 mSDtfsCounter, 3838 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1713 GetRequests, 1609 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1343occurred in iteration=11, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 91 LocationsWithAnnotation, 2825 PreInvPairs, 3017 NumberOfFragments, 1878 HoareAnnotationTreeSize, 2825 FomulaSimplifications, 134691 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 91 FomulaSimplificationsInter, 45098 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2810 ConstructedInterpolants, 0 QuantifiedInterpolants, 5080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6422 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 737/807 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: 934]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - 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 - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || (1 <= i && i <= 2147483646)) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || !(ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 1) - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1506]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1371]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0) || !(ref_cnt <= 0) - InvariantResult [Line: 1469]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1356]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1479]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1462]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || (1 <= i && i < 2147483646)) || !(ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 1) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1499]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1455]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1340]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - 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: 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: 1225]: Loop Invariant Derived loop invariant: (((((((ref_cnt <= 0 && ldv_count_1 == 0) && probed_1 <= 0) && 0 <= ref_cnt) && ldv_state_variable_0 == 2) && ldv_count_2 == 0) || (((((ldv_count_1 == 0 && ldv_state_variable_1 == 2) && ldv_state_variable_0 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ref_cnt <= 1)) || ((probed_1 <= 0 && ldv_state_variable_1 == 0) && ldv_state_variable_0 == 2)) || ((((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) - 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: 1485]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 12:13:01,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a02489c-5afc-4b8a-9a2c-eb8394c3e869/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE