./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R --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 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c --- 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-38b53e6 [2022-11-25 16:48:58,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:48:58,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:48:58,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:48:58,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:48:58,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:48:58,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:48:58,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:48:58,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:48:58,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:48:58,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:48:58,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:48:58,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:48:58,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:48:58,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:48:58,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:48:58,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:48:58,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:48:58,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:48:58,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:48:58,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:48:58,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:48:58,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:48:58,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:48:58,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:48:58,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:48:58,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:48:58,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:48:58,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:48:58,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:48:58,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:48:58,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:48:58,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:48:58,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:48:58,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:48:58,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:48:58,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:48:58,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:48:58,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:48:58,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:48:58,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:48:58,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 16:48:58,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:48:58,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:48:58,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:48:58,868 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:48:58,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:48:58,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:48:58,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:48:58,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:48:58,871 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:48:58,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:48:58,873 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:48:58,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:48:58,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:48:58,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:48:58,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:48:58,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:48:58,875 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:48:58,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:48:58,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:48:58,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:48:58,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:48:58,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:48:58,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:48:58,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:48:58,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:48:58,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:48:58,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:48:58,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:48:58,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:48:58,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:48:58,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:48:58,880 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:48:58,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:48:58,880 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/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_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R 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 -> 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c [2022-11-25 16:48:59,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:48:59,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:48:59,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:48:59,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:48:59,182 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:48:59,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-25 16:49:02,583 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:49:03,040 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:49:03,041 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-25 16:49:03,070 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/data/ba5e5203c/163e37ae8722457794a28c15026097da/FLAGe389f1935 [2022-11-25 16:49:03,090 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/data/ba5e5203c/163e37ae8722457794a28c15026097da [2022-11-25 16:49:03,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:49:03,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:49:03,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:49:03,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:49:03,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:49:03,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:49:03" (1/1) ... [2022-11-25 16:49:03,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3c536f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:03, skipping insertion in model container [2022-11-25 16:49:03,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:49:03" (1/1) ... [2022-11-25 16:49:03,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:49:03,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:49:03,635 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_94d879d6-ea46-4d95-add9-43662437c538/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-11-25 16:49:03,649 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 16:49:03,654 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 16:49:03,665 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_interruptible_nested [2022-11-25 16:49:03,667 WARN L623 FunctionHandler]: Unknown extern function dev_printk [2022-11-25 16:49:03,670 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_read [2022-11-25 16:49:03,671 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 16:49:03,694 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,702 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 16:49:03,705 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,708 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 16:49:03,709 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 16:49:03,713 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,716 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,717 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-11-25 16:49:03,718 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_register [2022-11-25 16:49:03,719 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,722 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_register [2022-11-25 16:49:03,723 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,726 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-11-25 16:49:03,727 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,729 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,734 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 16:49:03,735 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 16:49:03,736 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 16:49:03,740 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 16:49:03,741 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 16:49:03,745 WARN L623 FunctionHandler]: Unknown extern function platform_driver_register [2022-11-25 16:49:03,747 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-11-25 16:49:03,757 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-11-25 16:49:03,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:49:03,793 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:49:03,843 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_94d879d6-ea46-4d95-add9-43662437c538/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-11-25 16:49:03,845 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 16:49:03,846 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 16:49:03,848 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_interruptible_nested [2022-11-25 16:49:03,849 WARN L623 FunctionHandler]: Unknown extern function dev_printk [2022-11-25 16:49:03,850 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_read [2022-11-25 16:49:03,867 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 16:49:03,880 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,885 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 16:49:03,895 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,896 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 16:49:03,897 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-11-25 16:49:03,899 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,901 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,907 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-11-25 16:49:03,908 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_register [2022-11-25 16:49:03,909 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,912 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_register [2022-11-25 16:49:03,915 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,918 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-11-25 16:49:03,919 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,925 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-11-25 16:49:03,933 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 16:49:03,934 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 16:49:03,934 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 16:49:03,936 WARN L623 FunctionHandler]: Unknown extern function hwmon_device_unregister [2022-11-25 16:49:03,936 WARN L623 FunctionHandler]: Unknown extern function s3c_adc_release [2022-11-25 16:49:03,938 WARN L623 FunctionHandler]: Unknown extern function platform_driver_register [2022-11-25 16:49:03,938 WARN L623 FunctionHandler]: Unknown extern function platform_driver_unregister [2022-11-25 16:49:03,961 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-11-25 16:49:03,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:49:03,999 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:49:04,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04 WrapperNode [2022-11-25 16:49:04,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:49:04,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:49:04,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:49:04,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:49:04,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,095 INFO L138 Inliner]: procedures = 78, calls = 157, calls flagged for inlining = 30, calls inlined = 26, statements flattened = 525 [2022-11-25 16:49:04,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:49:04,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:49:04,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:49:04,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:49:04,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,199 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:49:04,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:49:04,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:49:04,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:49:04,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (1/1) ... [2022-11-25 16:49:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:49:04,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:04,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:49:04,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:49:04,351 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-11-25 16:49:04,351 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-11-25 16:49:04,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:49:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:49:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 16:49:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-25 16:49:04,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-25 16:49:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:49:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 16:49:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-25 16:49:04,355 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-25 16:49:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-25 16:49:04,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-25 16:49:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 16:49:04,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 16:49:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-11-25 16:49:04,360 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-11-25 16:49:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:49:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 16:49:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-25 16:49:04,361 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-25 16:49:04,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-25 16:49:04,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-25 16:49:04,362 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-25 16:49:04,363 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-25 16:49:04,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:49:04,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-25 16:49:04,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-25 16:49:04,365 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-11-25 16:49:04,366 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-11-25 16:49:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 16:49:04,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 16:49:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:49:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:49:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-25 16:49:04,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-25 16:49:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-25 16:49:04,369 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-25 16:49:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:49:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:49:04,371 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-25 16:49:04,371 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-25 16:49:04,732 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:49:04,735 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:49:04,884 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-25 16:49:05,531 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:49:05,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:49:05,548 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:49:05,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:49:05 BoogieIcfgContainer [2022-11-25 16:49:05,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:49:05,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:49:05,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:49:05,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:49:05,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:49:03" (1/3) ... [2022-11-25 16:49:05,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f1265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:49:05, skipping insertion in model container [2022-11-25 16:49:05,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:49:04" (2/3) ... [2022-11-25 16:49:05,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776f1265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:49:05, skipping insertion in model container [2022-11-25 16:49:05,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:49:05" (3/3) ... [2022-11-25 16:49:05,562 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-25 16:49:05,585 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:49:05,586 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 16:49:05,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:49:05,659 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;@513ebdac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:49:05,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 16:49:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 146 states have (on average 1.36986301369863) internal successors, (200), 165 states have internal predecessors, (200), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-25 16:49:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 16:49:05,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:05,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:05,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 40400747, now seen corresponding path program 1 times [2022-11-25 16:49:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:05,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182347877] [2022-11-25 16:49:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:06,085 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-25 16:49:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:06,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182347877] [2022-11-25 16:49:06,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182347877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:06,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:06,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537630603] [2022-11-25 16:49:06,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:06,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:49:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:49:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:06,166 INFO L87 Difference]: Start difference. First operand has 209 states, 146 states have (on average 1.36986301369863) internal successors, (200), 165 states have internal predecessors, (200), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-25 16:49:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:06,354 INFO L93 Difference]: Finished difference Result 440 states and 576 transitions. [2022-11-25 16:49:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:49:06,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2022-11-25 16:49:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:06,383 INFO L225 Difference]: With dead ends: 440 [2022-11-25 16:49:06,384 INFO L226 Difference]: Without dead ends: 211 [2022-11-25 16:49:06,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:49:06,403 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 35 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:06,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 509 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-25 16:49:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-11-25 16:49:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 168 states have internal predecessors, (208), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-25 16:49:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2022-11-25 16:49:06,524 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 12 [2022-11-25 16:49:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:06,524 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2022-11-25 16:49:06,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-25 16:49:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2022-11-25 16:49:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 16:49:06,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:06,529 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] [2022-11-25 16:49:06,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:49:06,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1470941572, now seen corresponding path program 1 times [2022-11-25 16:49:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:06,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461450644] [2022-11-25 16:49:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:06,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:06,925 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-25 16:49:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461450644] [2022-11-25 16:49:06,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461450644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:06,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:06,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:49:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856601478] [2022-11-25 16:49:06,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:06,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:49:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:49:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:49:06,938 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-25 16:49:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:07,819 INFO L93 Difference]: Finished difference Result 435 states and 555 transitions. [2022-11-25 16:49:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-11-25 16:49:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:07,826 INFO L225 Difference]: With dead ends: 435 [2022-11-25 16:49:07,827 INFO L226 Difference]: Without dead ends: 431 [2022-11-25 16:49:07,827 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-25 16:49:07,829 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 262 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:07,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 641 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:49:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-25 16:49:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 405. [2022-11-25 16:49:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 305 states have (on average 1.340983606557377) internal successors, (409), 320 states have internal predecessors, (409), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-25 16:49:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 529 transitions. [2022-11-25 16:49:07,880 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 529 transitions. Word has length 30 [2022-11-25 16:49:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:07,881 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 529 transitions. [2022-11-25 16:49:07,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-25 16:49:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 529 transitions. [2022-11-25 16:49:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 16:49:07,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:07,884 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] [2022-11-25 16:49:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:49:07,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -737337866, now seen corresponding path program 1 times [2022-11-25 16:49:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:07,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553945738] [2022-11-25 16:49:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:49:08,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:08,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553945738] [2022-11-25 16:49:08,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553945738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:08,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:08,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:49:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433817874] [2022-11-25 16:49:08,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:08,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:08,036 INFO L87 Difference]: Start difference. First operand 405 states and 529 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-25 16:49:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:08,862 INFO L93 Difference]: Finished difference Result 1047 states and 1364 transitions. [2022-11-25 16:49:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:49:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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 40 [2022-11-25 16:49:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:08,872 INFO L225 Difference]: With dead ends: 1047 [2022-11-25 16:49:08,874 INFO L226 Difference]: Without dead ends: 837 [2022-11-25 16:49:08,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:49:08,877 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 321 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:08,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 813 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:49:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-11-25 16:49:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 409. [2022-11-25 16:49:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 309 states have (on average 1.3365695792880259) internal successors, (413), 324 states have internal predecessors, (413), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-25 16:49:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 533 transitions. [2022-11-25 16:49:08,949 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 533 transitions. Word has length 40 [2022-11-25 16:49:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:08,950 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 533 transitions. [2022-11-25 16:49:08,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-25 16:49:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 533 transitions. [2022-11-25 16:49:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 16:49:08,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:08,959 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 16:49:08,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:49:08,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash -233294408, now seen corresponding path program 1 times [2022-11-25 16:49:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:08,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428910261] [2022-11-25 16:49:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 16:49:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:49:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:09,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428910261] [2022-11-25 16:49:09,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428910261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:09,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:09,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:49:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746853968] [2022-11-25 16:49:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:09,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:09,228 INFO L87 Difference]: Start difference. First operand 409 states and 533 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:49:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:09,651 INFO L93 Difference]: Finished difference Result 864 states and 1118 transitions. [2022-11-25 16:49:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:09,652 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-11-25 16:49:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:09,657 INFO L225 Difference]: With dead ends: 864 [2022-11-25 16:49:09,657 INFO L226 Difference]: Without dead ends: 458 [2022-11-25 16:49:09,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-25 16:49:09,663 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 227 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:09,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 582 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-25 16:49:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 444. [2022-11-25 16:49:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 338 states have (on average 1.319526627218935) internal successors, (446), 353 states have internal predecessors, (446), 59 states have call successors, (59), 33 states have call predecessors, (59), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-25 16:49:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 564 transitions. [2022-11-25 16:49:09,747 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 564 transitions. Word has length 58 [2022-11-25 16:49:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:09,748 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 564 transitions. [2022-11-25 16:49:09,748 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:49:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 564 transitions. [2022-11-25 16:49:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:49:09,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:09,751 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 16:49:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:49:09,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1543729732, now seen corresponding path program 1 times [2022-11-25 16:49:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851260779] [2022-11-25 16:49:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 16:49:09,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:09,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851260779] [2022-11-25 16:49:09,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851260779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:09,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:09,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:49:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186153470] [2022-11-25 16:49:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:09,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:09,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:09,874 INFO L87 Difference]: Start difference. First operand 444 states and 564 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 16:49:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:10,583 INFO L93 Difference]: Finished difference Result 1056 states and 1338 transitions. [2022-11-25 16:49:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:49:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-11-25 16:49:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:10,593 INFO L225 Difference]: With dead ends: 1056 [2022-11-25 16:49:10,593 INFO L226 Difference]: Without dead ends: 788 [2022-11-25 16:49:10,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:49:10,595 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 281 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:10,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 773 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:49:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-25 16:49:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 444. [2022-11-25 16:49:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 338 states have (on average 1.319526627218935) internal successors, (446), 353 states have internal predecessors, (446), 59 states have call successors, (59), 33 states have call predecessors, (59), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-25 16:49:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 564 transitions. [2022-11-25 16:49:10,696 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 564 transitions. Word has length 56 [2022-11-25 16:49:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:10,698 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 564 transitions. [2022-11-25 16:49:10,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 16:49:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 564 transitions. [2022-11-25 16:49:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 16:49:10,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:10,707 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 16:49:10,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:49:10,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1987107495, now seen corresponding path program 1 times [2022-11-25 16:49:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:10,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525644596] [2022-11-25 16:49:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 16:49:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 16:49:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525644596] [2022-11-25 16:49:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525644596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:10,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:49:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187689720] [2022-11-25 16:49:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:10,895 INFO L87 Difference]: Start difference. First operand 444 states and 564 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 16:49:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:11,274 INFO L93 Difference]: Finished difference Result 934 states and 1205 transitions. [2022-11-25 16:49:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:11,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2022-11-25 16:49:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:11,278 INFO L225 Difference]: With dead ends: 934 [2022-11-25 16:49:11,278 INFO L226 Difference]: Without dead ends: 510 [2022-11-25 16:49:11,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:11,281 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 114 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:11,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 472 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-25 16:49:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 496. [2022-11-25 16:49:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 384 states have (on average 1.328125) internal successors, (510), 399 states have internal predecessors, (510), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 640 transitions. [2022-11-25 16:49:11,339 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 640 transitions. Word has length 80 [2022-11-25 16:49:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:11,341 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 640 transitions. [2022-11-25 16:49:11,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 16:49:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 640 transitions. [2022-11-25 16:49:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 16:49:11,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:11,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:11,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:49:11,345 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1009855611, now seen corresponding path program 1 times [2022-11-25 16:49:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:11,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652703824] [2022-11-25 16:49:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 16:49:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 16:49:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652703824] [2022-11-25 16:49:11,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652703824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021657176] [2022-11-25 16:49:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:11,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:11,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:49:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:11,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:49:11,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:12,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:49:12,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021657176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:12,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:49:12,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 16:49:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691749656] [2022-11-25 16:49:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:12,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:49:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:49:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:49:12,007 INFO L87 Difference]: Start difference. First operand 496 states and 640 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 16:49:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:12,165 INFO L93 Difference]: Finished difference Result 1092 states and 1425 transitions. [2022-11-25 16:49:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2022-11-25 16:49:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:12,170 INFO L225 Difference]: With dead ends: 1092 [2022-11-25 16:49:12,170 INFO L226 Difference]: Without dead ends: 616 [2022-11-25 16:49:12,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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-25 16:49:12,173 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 115 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:12,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 761 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-11-25 16:49:12,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 495. [2022-11-25 16:49:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 386 states have (on average 1.310880829015544) internal successors, (506), 398 states have internal predecessors, (506), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 636 transitions. [2022-11-25 16:49:12,239 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 636 transitions. Word has length 85 [2022-11-25 16:49:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:12,239 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 636 transitions. [2022-11-25 16:49:12,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 16:49:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 636 transitions. [2022-11-25 16:49:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 16:49:12,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:12,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:12,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 16:49:12,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:12,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1240753136, now seen corresponding path program 1 times [2022-11-25 16:49:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:12,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605105320] [2022-11-25 16:49:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 16:49:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 16:49:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:12,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:12,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605105320] [2022-11-25 16:49:12,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605105320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:12,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503095830] [2022-11-25 16:49:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:12,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:12,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:12,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:12,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:49:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:12,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:49:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:12,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503095830] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:13,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:13,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-25 16:49:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86460976] [2022-11-25 16:49:13,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:13,069 INFO L87 Difference]: Start difference. First operand 495 states and 636 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 3 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-25 16:49:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:13,876 INFO L93 Difference]: Finished difference Result 948 states and 1285 transitions. [2022-11-25 16:49:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:49:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 3 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 86 [2022-11-25 16:49:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:13,917 INFO L225 Difference]: With dead ends: 948 [2022-11-25 16:49:13,917 INFO L226 Difference]: Without dead ends: 945 [2022-11-25 16:49:13,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:13,920 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 511 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1194 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:49:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-11-25 16:49:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 488. [2022-11-25 16:49:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 382 states have (on average 1.2984293193717278) internal successors, (496), 391 states have internal predecessors, (496), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 626 transitions. [2022-11-25 16:49:13,985 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 626 transitions. Word has length 86 [2022-11-25 16:49:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 626 transitions. [2022-11-25 16:49:13,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 3 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-25 16:49:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 626 transitions. [2022-11-25 16:49:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 16:49:13,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:13,997 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 16:49:14,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:14,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 16:49:14,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash 526978300, now seen corresponding path program 1 times [2022-11-25 16:49:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:14,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560171021] [2022-11-25 16:49:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 16:49:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 16:49:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560171021] [2022-11-25 16:49:14,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560171021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:14,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:14,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:49:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967585430] [2022-11-25 16:49:14,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:14,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:14,601 INFO L87 Difference]: Start difference. First operand 488 states and 626 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 16:49:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:15,339 INFO L93 Difference]: Finished difference Result 982 states and 1267 transitions. [2022-11-25 16:49:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2022-11-25 16:49:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:15,347 INFO L225 Difference]: With dead ends: 982 [2022-11-25 16:49:15,347 INFO L226 Difference]: Without dead ends: 980 [2022-11-25 16:49:15,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-25 16:49:15,351 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 244 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:15,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 643 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:49:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-11-25 16:49:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 946. [2022-11-25 16:49:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 742 states have (on average 1.2924528301886793) internal successors, (959), 753 states have internal predecessors, (959), 130 states have call successors, (130), 66 states have call predecessors, (130), 66 states have return successors, (138), 130 states have call predecessors, (138), 130 states have call successors, (138) [2022-11-25 16:49:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1227 transitions. [2022-11-25 16:49:15,486 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1227 transitions. Word has length 87 [2022-11-25 16:49:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:15,487 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1227 transitions. [2022-11-25 16:49:15,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 16:49:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1227 transitions. [2022-11-25 16:49:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-25 16:49:15,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:15,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:15,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:49:15,493 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -225818043, now seen corresponding path program 1 times [2022-11-25 16:49:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:15,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655267314] [2022-11-25 16:49:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 16:49:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 16:49:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 16:49:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 16:49:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655267314] [2022-11-25 16:49:15,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655267314] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116458376] [2022-11-25 16:49:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:15,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:16,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:49:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:16,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:49:16,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:49:16,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:49:16,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116458376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:16,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:49:16,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-11-25 16:49:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935110772] [2022-11-25 16:49:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:16,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:49:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:49:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:49:16,807 INFO L87 Difference]: Start difference. First operand 946 states and 1227 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 16:49:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:17,179 INFO L93 Difference]: Finished difference Result 962 states and 1235 transitions. [2022-11-25 16:49:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:49:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 102 [2022-11-25 16:49:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:17,182 INFO L225 Difference]: With dead ends: 962 [2022-11-25 16:49:17,182 INFO L226 Difference]: Without dead ends: 480 [2022-11-25 16:49:17,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:49:17,185 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 176 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:17,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 426 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:49:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-11-25 16:49:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-11-25 16:49:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 376 states have (on average 1.2872340425531914) internal successors, (484), 383 states have internal predecessors, (484), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 614 transitions. [2022-11-25 16:49:17,237 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 614 transitions. Word has length 102 [2022-11-25 16:49:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:17,238 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 614 transitions. [2022-11-25 16:49:17,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 16:49:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 614 transitions. [2022-11-25 16:49:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 16:49:17,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:17,240 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:17,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:17,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 16:49:17,452 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 884730723, now seen corresponding path program 1 times [2022-11-25 16:49:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:17,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576398302] [2022-11-25 16:49:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 16:49:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 16:49:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:49:17,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:17,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576398302] [2022-11-25 16:49:17,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576398302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:17,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:17,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:49:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979123054] [2022-11-25 16:49:17,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:17,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:17,682 INFO L87 Difference]: Start difference. First operand 480 states and 614 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 16:49:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:18,100 INFO L93 Difference]: Finished difference Result 778 states and 995 transitions. [2022-11-25 16:49:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2022-11-25 16:49:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:18,104 INFO L225 Difference]: With dead ends: 778 [2022-11-25 16:49:18,105 INFO L226 Difference]: Without dead ends: 498 [2022-11-25 16:49:18,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:18,106 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 40 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:18,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 587 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-25 16:49:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 484. [2022-11-25 16:49:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.2849604221635884) internal successors, (487), 386 states have internal predecessors, (487), 66 states have call successors, (66), 33 states have call predecessors, (66), 33 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-25 16:49:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 619 transitions. [2022-11-25 16:49:18,188 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 619 transitions. Word has length 105 [2022-11-25 16:49:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:18,188 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 619 transitions. [2022-11-25 16:49:18,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 16:49:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 619 transitions. [2022-11-25 16:49:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 16:49:18,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:18,194 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:18,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:49:18,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1842214503, now seen corresponding path program 1 times [2022-11-25 16:49:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:18,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641606804] [2022-11-25 16:49:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 16:49:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 16:49:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 16:49:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 16:49:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:18,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641606804] [2022-11-25 16:49:18,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641606804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:18,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212058262] [2022-11-25 16:49:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:18,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:18,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:18,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:18,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:49:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:18,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:49:18,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 16:49:18,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:49:18,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212058262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:18,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:49:18,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 16:49:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801263078] [2022-11-25 16:49:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:18,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:49:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:18,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:49:18,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:49:18,855 INFO L87 Difference]: Start difference. First operand 484 states and 619 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-25 16:49:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:18,957 INFO L93 Difference]: Finished difference Result 648 states and 855 transitions. [2022-11-25 16:49:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2022-11-25 16:49:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:18,962 INFO L225 Difference]: With dead ends: 648 [2022-11-25 16:49:18,962 INFO L226 Difference]: Without dead ends: 647 [2022-11-25 16:49:18,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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-25 16:49:18,963 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 120 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:18,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 825 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:49:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-25 16:49:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 483. [2022-11-25 16:49:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 385 states have internal predecessors, (486), 66 states have call successors, (66), 33 states have call predecessors, (66), 33 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-25 16:49:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 618 transitions. [2022-11-25 16:49:19,059 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 618 transitions. Word has length 120 [2022-11-25 16:49:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:19,060 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 618 transitions. [2022-11-25 16:49:19,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-25 16:49:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 618 transitions. [2022-11-25 16:49:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-25 16:49:19,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:19,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:19,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 16:49:19,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 16:49:19,273 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1274074425, now seen corresponding path program 1 times [2022-11-25 16:49:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:19,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705962232] [2022-11-25 16:49:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 16:49:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 16:49:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 16:49:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 16:49:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705962232] [2022-11-25 16:49:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705962232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890618783] [2022-11-25 16:49:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:19,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:19,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:49:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:19,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:49:19,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 16:49:19,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 16:49:20,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890618783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:20,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:20,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-25 16:49:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347258373] [2022-11-25 16:49:20,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:20,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:20,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:20,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:20,070 INFO L87 Difference]: Start difference. First operand 483 states and 618 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 16:49:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:20,876 INFO L93 Difference]: Finished difference Result 1012 states and 1387 transitions. [2022-11-25 16:49:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:49:20,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 121 [2022-11-25 16:49:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:20,881 INFO L225 Difference]: With dead ends: 1012 [2022-11-25 16:49:20,882 INFO L226 Difference]: Without dead ends: 1011 [2022-11-25 16:49:20,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:20,883 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 428 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:20,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1715 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:49:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-25 16:49:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 479. [2022-11-25 16:49:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 377 states have (on average 1.2811671087533156) internal successors, (483), 382 states have internal predecessors, (483), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 613 transitions. [2022-11-25 16:49:20,952 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 613 transitions. Word has length 121 [2022-11-25 16:49:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:20,953 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 613 transitions. [2022-11-25 16:49:20,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 16:49:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 613 transitions. [2022-11-25 16:49:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-25 16:49:20,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:20,956 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 16:49:20,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:21,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:21,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1673402574, now seen corresponding path program 1 times [2022-11-25 16:49:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670764118] [2022-11-25 16:49:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 16:49:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 16:49:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 16:49:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 16:49:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:21,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670764118] [2022-11-25 16:49:21,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670764118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:21,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:21,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:49:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309792987] [2022-11-25 16:49:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:21,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:21,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:21,407 INFO L87 Difference]: Start difference. First operand 479 states and 613 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 16:49:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:21,752 INFO L93 Difference]: Finished difference Result 755 states and 961 transitions. [2022-11-25 16:49:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:49:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 114 [2022-11-25 16:49:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:21,755 INFO L225 Difference]: With dead ends: 755 [2022-11-25 16:49:21,756 INFO L226 Difference]: Without dead ends: 476 [2022-11-25 16:49:21,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-25 16:49:21,758 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 167 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:21,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 510 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:49:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-25 16:49:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 462. [2022-11-25 16:49:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 360 states have (on average 1.2666666666666666) internal successors, (456), 365 states have internal predecessors, (456), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 586 transitions. [2022-11-25 16:49:21,811 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 586 transitions. Word has length 114 [2022-11-25 16:49:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:21,811 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 586 transitions. [2022-11-25 16:49:21,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 16:49:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 586 transitions. [2022-11-25 16:49:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 16:49:21,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:21,814 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:21,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:49:21,814 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1111698611, now seen corresponding path program 1 times [2022-11-25 16:49:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:21,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450622903] [2022-11-25 16:49:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:21,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 16:49:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 16:49:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 16:49:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 16:49:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 16:49:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:22,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450622903] [2022-11-25 16:49:22,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450622903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:22,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965042671] [2022-11-25 16:49:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:22,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:22,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:49:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:22,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:49:22,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 16:49:22,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:49:22,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965042671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:22,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:49:22,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-25 16:49:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870101824] [2022-11-25 16:49:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:22,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:49:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:49:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:49:22,574 INFO L87 Difference]: Start difference. First operand 462 states and 586 transitions. Second operand has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 16:49:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:22,783 INFO L93 Difference]: Finished difference Result 642 states and 820 transitions. [2022-11-25 16:49:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2022-11-25 16:49:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:22,788 INFO L225 Difference]: With dead ends: 642 [2022-11-25 16:49:22,788 INFO L226 Difference]: Without dead ends: 640 [2022-11-25 16:49:22,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 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-25 16:49:22,792 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 307 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:22,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 541 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:49:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-25 16:49:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 460. [2022-11-25 16:49:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 360 states have (on average 1.261111111111111) internal successors, (454), 363 states have internal predecessors, (454), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 16:49:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 584 transitions. [2022-11-25 16:49:22,866 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 584 transitions. Word has length 119 [2022-11-25 16:49:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:22,867 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 584 transitions. [2022-11-25 16:49:22,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 16:49:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 584 transitions. [2022-11-25 16:49:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 16:49:22,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:22,871 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:22,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:23,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 16:49:23,080 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -102918237, now seen corresponding path program 1 times [2022-11-25 16:49:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:23,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275998758] [2022-11-25 16:49:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 16:49:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 16:49:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 16:49:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 16:49:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 16:49:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 16:49:23,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:23,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275998758] [2022-11-25 16:49:23,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275998758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:23,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335643022] [2022-11-25 16:49:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:23,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:23,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:49:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:23,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 16:49:23,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 16:49:23,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 16:49:24,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335643022] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:24,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:24,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-25 16:49:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743882139] [2022-11-25 16:49:24,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:24,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:49:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:49:24,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:49:24,111 INFO L87 Difference]: Start difference. First operand 460 states and 584 transitions. Second operand has 9 states, 8 states have (on average 25.75) internal successors, (206), 7 states have internal predecessors, (206), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-25 16:49:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:25,328 INFO L93 Difference]: Finished difference Result 927 states and 1178 transitions. [2022-11-25 16:49:25,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:49:25,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 25.75) internal successors, (206), 7 states have internal predecessors, (206), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 120 [2022-11-25 16:49:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:25,335 INFO L225 Difference]: With dead ends: 927 [2022-11-25 16:49:25,336 INFO L226 Difference]: Without dead ends: 925 [2022-11-25 16:49:25,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:49:25,337 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 1329 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:25,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 729 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 16:49:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-11-25 16:49:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 717. [2022-11-25 16:49:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 559 states have (on average 1.2522361359570662) internal successors, (700), 562 states have internal predecessors, (700), 103 states have call successors, (103), 54 states have call predecessors, (103), 54 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-11-25 16:49:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 906 transitions. [2022-11-25 16:49:25,442 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 906 transitions. Word has length 120 [2022-11-25 16:49:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:25,443 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 906 transitions. [2022-11-25 16:49:25,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 25.75) internal successors, (206), 7 states have internal predecessors, (206), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-25 16:49:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 906 transitions. [2022-11-25 16:49:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-25 16:49:25,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:49:25,447 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-11-25 16:49:25,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:49:25,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 16:49:25,655 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-25 16:49:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1354527541, now seen corresponding path program 1 times [2022-11-25 16:49:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:25,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943910964] [2022-11-25 16:49:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:25,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:49:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 16:49:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 16:49:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 16:49:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 16:49:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 16:49:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 16:49:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 16:49:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 16:49:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 16:49:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 16:49:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-25 16:49:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-25 16:49:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-25 16:49:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 16:49:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-25 16:49:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 16:49:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:26,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943910964] [2022-11-25 16:49:26,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943910964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:49:26,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:49:26,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:49:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175225358] [2022-11-25 16:49:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:49:26,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:49:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:26,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:49:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:49:26,004 INFO L87 Difference]: Start difference. First operand 717 states and 906 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 16:49:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:26,327 INFO L93 Difference]: Finished difference Result 978 states and 1232 transitions. [2022-11-25 16:49:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:49:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 198 [2022-11-25 16:49:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:49:26,328 INFO L225 Difference]: With dead ends: 978 [2022-11-25 16:49:26,328 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 16:49:26,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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-25 16:49:26,330 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 195 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:49:26,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 482 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:49:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 16:49:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 16:49:26,332 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-25 16:49:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 16:49:26,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2022-11-25 16:49:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:49:26,332 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:49:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 16:49:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:49:26,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 16:49:26,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-25 16:49:26,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-25 16:49:26,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-25 16:49:26,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-25 16:49:26,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-25 16:49:26,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-25 16:49:26,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-25 16:49:26,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-25 16:49:26,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-25 16:49:26,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-25 16:49:26,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-25 16:49:26,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-25 16:49:26,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-25 16:49:26,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-25 16:49:26,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:49:26,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 16:49:35,285 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 938 943) the Hoare annotation is: true [2022-11-25 16:49:35,286 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 938 943) no Hoare annotation was computed. [2022-11-25 16:49:35,286 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 938 943) no Hoare annotation was computed. [2022-11-25 16:49:35,286 INFO L895 garLoopResultBuilder]: At program point platform_get_drvdataENTRY(lines 893 900) the Hoare annotation is: (or (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_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-11-25 16:49:35,287 INFO L895 garLoopResultBuilder]: At program point L1407(line 1407) the Hoare annotation is: (or (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_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (not (<= ~ldv_count_1~0 0))) [2022-11-25 16:49:35,287 INFO L899 garLoopResultBuilder]: For program point L1407-1(line 1407) no Hoare annotation was computed. [2022-11-25 16:49:35,287 INFO L902 garLoopResultBuilder]: At program point L1407-2(lines 1406 1408) the Hoare annotation is: true [2022-11-25 16:49:35,287 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 893 900) no Hoare annotation was computed. [2022-11-25 16:49:35,287 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 893 900) no Hoare annotation was computed. [2022-11-25 16:49:35,287 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeFINAL(lines 1376 1392) no Hoare annotation was computed. [2022-11-25 16:49:35,288 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1381) no Hoare annotation was computed. [2022-11-25 16:49:35,288 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1381) no Hoare annotation was computed. [2022-11-25 16:49:35,288 INFO L895 garLoopResultBuilder]: At program point L845(lines 840 847) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-11-25 16:49:35,288 INFO L902 garLoopResultBuilder]: At program point L1385(line 1385) the Hoare annotation is: true [2022-11-25 16:49:35,288 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 1376 1392) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-11-25 16:49:35,292 INFO L899 garLoopResultBuilder]: For program point L1383(lines 1383 1386) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L899 garLoopResultBuilder]: For program point L1381(line 1381) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L899 garLoopResultBuilder]: For program point L1380(lines 1380 1388) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L899 garLoopResultBuilder]: For program point L1381-1(line 1381) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L899 garLoopResultBuilder]: For program point L1380-1(lines 1380 1388) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 1376 1392) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1426 1428) no Hoare annotation was computed. [2022-11-25 16:49:35,293 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1426 1428) the Hoare annotation is: true [2022-11-25 16:49:35,294 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1426 1428) no Hoare annotation was computed. [2022-11-25 16:49:35,294 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 856 862) no Hoare annotation was computed. [2022-11-25 16:49:35,294 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 856 862) the Hoare annotation is: true [2022-11-25 16:49:35,294 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 856 862) no Hoare annotation was computed. [2022-11-25 16:49:35,296 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 863 869) no Hoare annotation was computed. [2022-11-25 16:49:35,297 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 863 869) the Hoare annotation is: true [2022-11-25 16:49:35,297 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1453 1455) the Hoare annotation is: true [2022-11-25 16:49:35,297 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1453 1455) no Hoare annotation was computed. [2022-11-25 16:49:35,297 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1453 1455) no Hoare annotation was computed. [2022-11-25 16:49:35,297 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-11-25 16:49:35,298 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-11-25 16:49:35,298 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-11-25 16:49:35,298 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-11-25 16:49:35,298 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1342 1347) the Hoare annotation is: true [2022-11-25 16:49:35,298 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1290 1297) no Hoare annotation was computed. [2022-11-25 16:49:35,298 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1290 1297) the Hoare annotation is: true [2022-11-25 16:49:35,299 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1290 1297) no Hoare annotation was computed. [2022-11-25 16:49:35,299 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1330 1335) no Hoare annotation was computed. [2022-11-25 16:49:35,299 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1330 1335) the Hoare annotation is: true [2022-11-25 16:49:35,299 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1330 1335) no Hoare annotation was computed. [2022-11-25 16:49:35,299 INFO L899 garLoopResultBuilder]: For program point L817(line 817) no Hoare annotation was computed. [2022-11-25 16:49:35,299 INFO L902 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: true [2022-11-25 16:49:35,300 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-11-25 16:49:35,300 INFO L902 garLoopResultBuilder]: At program point L816-1(line 816) the Hoare annotation is: true [2022-11-25 16:49:35,300 INFO L899 garLoopResultBuilder]: For program point L817-2(line 817) no Hoare annotation was computed. [2022-11-25 16:49:35,300 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 804 821) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_count_2~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ldv_count_1~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 .cse2 (not (<= ~ref_cnt~0 1)) .cse3) (or (not (= ~ref_cnt~0 0)) (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse2 .cse3))) [2022-11-25 16:49:35,300 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 819) no Hoare annotation was computed. [2022-11-25 16:49:35,301 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 804 821) no Hoare annotation was computed. [2022-11-25 16:49:35,301 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 804 821) no Hoare annotation was computed. [2022-11-25 16:49:35,301 INFO L902 garLoopResultBuilder]: At program point L834-1(line 834) the Hoare annotation is: true [2022-11-25 16:49:35,301 INFO L899 garLoopResultBuilder]: For program point L835-2(line 835) no Hoare annotation was computed. [2022-11-25 16:49:35,301 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:49:35,301 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 837) no Hoare annotation was computed. [2022-11-25 16:49:35,302 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 822 839) no Hoare annotation was computed. [2022-11-25 16:49:35,302 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 822 839) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ldv_count_1~0 0))) [2022-11-25 16:49:35,302 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 822 839) no Hoare annotation was computed. [2022-11-25 16:49:35,302 INFO L899 garLoopResultBuilder]: For program point L835(line 835) no Hoare annotation was computed. [2022-11-25 16:49:35,302 INFO L902 garLoopResultBuilder]: At program point L834(line 834) the Hoare annotation is: true [2022-11-25 16:49:35,303 INFO L902 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: true [2022-11-25 16:49:35,303 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1420 1422) no Hoare annotation was computed. [2022-11-25 16:49:35,303 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1420 1422) the Hoare annotation is: true [2022-11-25 16:49:35,303 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1420 1422) no Hoare annotation was computed. [2022-11-25 16:49:35,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-25 16:49:35,303 INFO L902 garLoopResultBuilder]: At program point L1274(line 1274) the Hoare annotation is: true [2022-11-25 16:49:35,304 INFO L899 garLoopResultBuilder]: For program point L1159(line 1159) no Hoare annotation was computed. [2022-11-25 16:49:35,304 INFO L895 garLoopResultBuilder]: At program point L1027(lines 994 1029) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 16:49:35,304 INFO L895 garLoopResultBuilder]: At program point L1143(lines 1038 1145) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,304 INFO L899 garLoopResultBuilder]: For program point L1457(lines 1457 1459) no Hoare annotation was computed. [2022-11-25 16:49:35,305 INFO L895 garLoopResultBuilder]: At program point L1424(line 1424) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,305 INFO L899 garLoopResultBuilder]: For program point L1424-1(line 1424) no Hoare annotation was computed. [2022-11-25 16:49:35,305 INFO L895 garLoopResultBuilder]: At program point L1424-2(lines 1423 1425) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,305 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1264) no Hoare annotation was computed. [2022-11-25 16:49:35,305 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-11-25 16:49:35,305 INFO L899 garLoopResultBuilder]: For program point L1259-2(lines 1257 1270) no Hoare annotation was computed. [2022-11-25 16:49:35,306 INFO L895 garLoopResultBuilder]: At program point L1160(lines 1151 1168) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 2)) (.cse2 (<= 1 ~ref_cnt~0)) (.cse3 (= ~ldv_count_2~0 0)) (.cse4 (= ~ldv_state_variable_0~0 3)) (.cse5 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) .cse2 .cse3 .cse4 .cse5))) [2022-11-25 16:49:35,306 INFO L895 garLoopResultBuilder]: At program point L1127(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (let ((.cse0 (= ~ldv_state_variable_1~0 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646)) (and (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse0))) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,306 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2022-11-25 16:49:35,306 INFO L895 garLoopResultBuilder]: At program point L1441(lines 1440 1442) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-25 16:49:35,307 INFO L899 garLoopResultBuilder]: For program point L1111(lines 1111 1126) no Hoare annotation was computed. [2022-11-25 16:49:35,307 INFO L899 garLoopResultBuilder]: For program point L1078(lines 1078 1081) no Hoare annotation was computed. [2022-11-25 16:49:35,307 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1012 1026) no Hoare annotation was computed. [2022-11-25 16:49:35,307 INFO L899 garLoopResultBuilder]: For program point L1012-1(lines 1012 1026) no Hoare annotation was computed. [2022-11-25 16:49:35,307 INFO L895 garLoopResultBuilder]: At program point L1326(line 1326) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,307 INFO L899 garLoopResultBuilder]: For program point L1326-1(line 1326) no Hoare annotation was computed. [2022-11-25 16:49:35,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-11-25 16:49:35,308 INFO L899 garLoopResultBuilder]: For program point L1128(line 1128) no Hoare annotation was computed. [2022-11-25 16:49:35,308 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 1098) no Hoare annotation was computed. [2022-11-25 16:49:35,308 INFO L895 garLoopResultBuilder]: At program point L1310(line 1310) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,308 INFO L899 garLoopResultBuilder]: For program point L1310-1(line 1310) no Hoare annotation was computed. [2022-11-25 16:49:35,308 INFO L899 garLoopResultBuilder]: For program point L1244(line 1244) no Hoare annotation was computed. [2022-11-25 16:49:35,309 INFO L895 garLoopResultBuilder]: At program point L1178(lines 1173 1180) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-25 16:49:35,309 INFO L895 garLoopResultBuilder]: At program point L1013-1(line 1013) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,309 INFO L895 garLoopResultBuilder]: At program point L1327(lines 1322 1329) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,309 INFO L895 garLoopResultBuilder]: At program point L1162(lines 1151 1168) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_count_2~0 0))) (or (and .cse0 (< |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) .cse1) (and .cse0 (= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 0) .cse1))) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-25 16:49:35,310 INFO L895 garLoopResultBuilder]: At program point L1129(lines 1051 1144) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ref_cnt~0 0)) (.cse3 (= ~ldv_count_2~0 0)) (.cse4 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse1 .cse2 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) .cse3 .cse4))) [2022-11-25 16:49:35,310 INFO L895 garLoopResultBuilder]: At program point L1311(lines 1306 1313) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,310 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1278) no Hoare annotation was computed. [2022-11-25 16:49:35,310 INFO L899 garLoopResultBuilder]: For program point L1229(line 1229) no Hoare annotation was computed. [2022-11-25 16:49:35,310 INFO L895 garLoopResultBuilder]: At program point L1196(line 1196) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,311 INFO L899 garLoopResultBuilder]: For program point L1196-1(line 1196) no Hoare annotation was computed. [2022-11-25 16:49:35,311 INFO L902 garLoopResultBuilder]: At program point L1444(lines 1443 1445) the Hoare annotation is: true [2022-11-25 16:49:35,311 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1282) no Hoare annotation was computed. [2022-11-25 16:49:35,311 INFO L899 garLoopResultBuilder]: For program point L1114(line 1114) no Hoare annotation was computed. [2022-11-25 16:49:35,311 INFO L899 garLoopResultBuilder]: For program point L1114-1(line 1114) no Hoare annotation was computed. [2022-11-25 16:49:35,311 INFO L899 garLoopResultBuilder]: For program point L1230(lines 1230 1235) no Hoare annotation was computed. [2022-11-25 16:49:35,312 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1051 1144) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 16:49:35,312 INFO L899 garLoopResultBuilder]: For program point L1280(line 1280) no Hoare annotation was computed. [2022-11-25 16:49:35,312 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1275) no Hoare annotation was computed. [2022-11-25 16:49:35,312 INFO L899 garLoopResultBuilder]: For program point L1214(line 1214) no Hoare annotation was computed. [2022-11-25 16:49:35,312 INFO L895 garLoopResultBuilder]: At program point L1396(lines 1393 1398) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-11-25 16:49:35,313 INFO L895 garLoopResultBuilder]: At program point L1198(lines 1192 1200) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,313 INFO L895 garLoopResultBuilder]: At program point L1165(line 1165) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-25 16:49:35,313 INFO L899 garLoopResultBuilder]: For program point L1165-1(line 1165) no Hoare annotation was computed. [2022-11-25 16:49:35,313 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1103) no Hoare annotation was computed. [2022-11-25 16:49:35,313 INFO L899 garLoopResultBuilder]: For program point L1099-2(lines 1099 1103) no Hoare annotation was computed. [2022-11-25 16:49:35,314 INFO L895 garLoopResultBuilder]: At program point L1000-1(line 1000) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,314 INFO L902 garLoopResultBuilder]: At program point L1281(line 1281) the Hoare annotation is: true [2022-11-25 16:49:35,314 INFO L899 garLoopResultBuilder]: For program point L1248(line 1248) no Hoare annotation was computed. [2022-11-25 16:49:35,314 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1242) no Hoare annotation was computed. [2022-11-25 16:49:35,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-25 16:49:35,314 INFO L895 garLoopResultBuilder]: At program point L1083(line 1083) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,315 INFO L899 garLoopResultBuilder]: For program point L1083-1(line 1083) no Hoare annotation was computed. [2022-11-25 16:49:35,315 INFO L902 garLoopResultBuilder]: At program point L1430(lines 1429 1431) the Hoare annotation is: true [2022-11-25 16:49:35,315 INFO L895 garLoopResultBuilder]: At program point L1166(line 1166) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-25 16:49:35,315 INFO L899 garLoopResultBuilder]: For program point L1166-1(line 1166) no Hoare annotation was computed. [2022-11-25 16:49:35,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-11-25 16:49:35,315 INFO L895 garLoopResultBuilder]: At program point L935(lines 932 937) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,316 INFO L895 garLoopResultBuilder]: At program point L1414(lines 1413 1415) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,316 INFO L899 garLoopResultBuilder]: For program point L1249(lines 1249 1254) no Hoare annotation was computed. [2022-11-25 16:49:35,316 INFO L899 garLoopResultBuilder]: For program point L1117(line 1117) no Hoare annotation was computed. [2022-11-25 16:49:35,316 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1090) no Hoare annotation was computed. [2022-11-25 16:49:35,316 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-11-25 16:49:35,317 INFO L899 garLoopResultBuilder]: For program point L1233-1(line 1233) no Hoare annotation was computed. [2022-11-25 16:49:35,317 INFO L895 garLoopResultBuilder]: At program point L1167(lines 1146 1169) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= |ULTIMATE.start_s3c_hwmon_remove_~i~1#1| 2147483646) (<= 1 |ULTIMATE.start_s3c_hwmon_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-25 16:49:35,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-11-25 16:49:35,317 INFO L895 garLoopResultBuilder]: At program point L1283(lines 1206 1288) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 0)) (.cse0 (<= ~ldv_count_1~0 0)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= ~ldv_state_variable_1~0 0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_1~0 1) .cse1 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse2 .cse3 (<= ~ref_cnt~0 1)))) [2022-11-25 16:49:35,317 INFO L899 garLoopResultBuilder]: For program point L1217(lines 1217 1239) no Hoare annotation was computed. [2022-11-25 16:49:35,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-11-25 16:49:35,318 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-25 16:49:35,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 16:49:35,318 INFO L902 garLoopResultBuilder]: At program point L1267(lines 1206 1288) the Hoare annotation is: true [2022-11-25 16:49:35,318 INFO L895 garLoopResultBuilder]: At program point L1069(line 1069) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,318 INFO L899 garLoopResultBuilder]: For program point L1069-1(line 1069) no Hoare annotation was computed. [2022-11-25 16:49:35,319 INFO L899 garLoopResultBuilder]: For program point L1218(line 1218) no Hoare annotation was computed. [2022-11-25 16:49:35,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-11-25 16:49:35,319 INFO L902 garLoopResultBuilder]: At program point L1185(lines 1181 1187) the Hoare annotation is: true [2022-11-25 16:49:35,319 INFO L895 garLoopResultBuilder]: At program point L1152(line 1152) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-25 16:49:35,319 INFO L895 garLoopResultBuilder]: At program point L1119(lines 1111 1125) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,319 INFO L899 garLoopResultBuilder]: For program point L1152-1(line 1152) no Hoare annotation was computed. [2022-11-25 16:49:35,320 INFO L895 garLoopResultBuilder]: At program point L1086(line 1086) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,320 INFO L899 garLoopResultBuilder]: For program point L1086-1(line 1086) no Hoare annotation was computed. [2022-11-25 16:49:35,320 INFO L899 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2022-11-25 16:49:35,320 INFO L895 garLoopResultBuilder]: At program point L1400(lines 1399 1401) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,320 INFO L895 garLoopResultBuilder]: At program point L1136(line 1136) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0)) [2022-11-25 16:49:35,320 INFO L899 garLoopResultBuilder]: For program point L1136-1(line 1136) no Hoare annotation was computed. [2022-11-25 16:49:35,321 INFO L899 garLoopResultBuilder]: For program point L1070(lines 1070 1076) no Hoare annotation was computed. [2022-11-25 16:49:35,321 INFO L895 garLoopResultBuilder]: At program point L905(lines 901 907) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,321 INFO L895 garLoopResultBuilder]: At program point L1318(line 1318) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,321 INFO L899 garLoopResultBuilder]: For program point L1318-1(line 1318) no Hoare annotation was computed. [2022-11-25 16:49:35,321 INFO L899 garLoopResultBuilder]: For program point L1219(lines 1219 1227) no Hoare annotation was computed. [2022-11-25 16:49:35,322 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1058) no Hoare annotation was computed. [2022-11-25 16:49:35,322 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,322 INFO L899 garLoopResultBuilder]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2022-11-25 16:49:35,322 INFO L895 garLoopResultBuilder]: At program point L1137(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,322 INFO L899 garLoopResultBuilder]: For program point L1104(lines 1104 1108) no Hoare annotation was computed. [2022-11-25 16:49:35,322 INFO L895 garLoopResultBuilder]: At program point L1451(line 1451) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-11-25 16:49:35,323 INFO L899 garLoopResultBuilder]: For program point L1451-1(line 1451) no Hoare annotation was computed. [2022-11-25 16:49:35,323 INFO L895 garLoopResultBuilder]: At program point L1451-2(lines 1450 1452) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,323 INFO L895 garLoopResultBuilder]: At program point L1319(lines 1314 1321) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3))) [2022-11-25 16:49:35,323 INFO L895 garLoopResultBuilder]: At program point L1154(line 1154) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-25 16:49:35,324 INFO L895 garLoopResultBuilder]: At program point L1121(lines 1111 1125) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,324 INFO L899 garLoopResultBuilder]: For program point L1154-1(line 1154) no Hoare annotation was computed. [2022-11-25 16:49:35,324 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-25 16:49:35,324 INFO L895 garLoopResultBuilder]: At program point L1138(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,324 INFO L895 garLoopResultBuilder]: At program point L1072(line 1072) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,325 INFO L899 garLoopResultBuilder]: For program point L1072-1(line 1072) no Hoare annotation was computed. [2022-11-25 16:49:35,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-11-25 16:49:35,325 INFO L902 garLoopResultBuilder]: At program point L1287(lines 1201 1289) the Hoare annotation is: true [2022-11-25 16:49:35,325 INFO L899 garLoopResultBuilder]: For program point L1221(lines 1221 1225) no Hoare annotation was computed. [2022-11-25 16:49:35,325 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:49:35,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-11-25 16:49:35,326 INFO L902 garLoopResultBuilder]: At program point L1238(line 1238) the Hoare annotation is: true [2022-11-25 16:49:35,326 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2022-11-25 16:49:35,326 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-11-25 16:49:35,326 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,326 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-25 16:49:35,326 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2022-11-25 16:49:35,327 INFO L899 garLoopResultBuilder]: For program point L1223(line 1223) no Hoare annotation was computed. [2022-11-25 16:49:35,327 INFO L899 garLoopResultBuilder]: For program point L1223-1(line 1223) no Hoare annotation was computed. [2022-11-25 16:49:35,327 INFO L895 garLoopResultBuilder]: At program point L1124(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3) (<= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0)) [2022-11-25 16:49:35,327 INFO L899 garLoopResultBuilder]: For program point L1273(line 1273) no Hoare annotation was computed. [2022-11-25 16:49:35,327 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-25 16:49:35,327 INFO L899 garLoopResultBuilder]: For program point L1257(lines 1257 1271) no Hoare annotation was computed. [2022-11-25 16:49:35,328 INFO L899 garLoopResultBuilder]: For program point L1158(line 1158) no Hoare annotation was computed. [2022-11-25 16:49:35,328 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1030 1037) no Hoare annotation was computed. [2022-11-25 16:49:35,328 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1030 1037) the Hoare annotation is: true [2022-11-25 16:49:35,328 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1030 1037) no Hoare annotation was computed. [2022-11-25 16:49:35,328 INFO L902 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: true [2022-11-25 16:49:35,328 INFO L902 garLoopResultBuilder]: At program point L1033-1(line 1033) the Hoare annotation is: true [2022-11-25 16:49:35,329 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1298 1305) the Hoare annotation is: true [2022-11-25 16:49:35,329 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1298 1305) no Hoare annotation was computed. [2022-11-25 16:49:35,329 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1298 1305) no Hoare annotation was computed. [2022-11-25 16:49:35,329 INFO L902 garLoopResultBuilder]: At program point L1302(line 1302) the Hoare annotation is: true [2022-11-25 16:49:35,329 INFO L899 garLoopResultBuilder]: For program point L1302-1(line 1302) no Hoare annotation was computed. [2022-11-25 16:49:35,332 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:49:35,335 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:49:35,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:49:35 BoogieIcfgContainer [2022-11-25 16:49:35,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:49:35,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:49:35,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:49:35,360 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:49:35,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:49:05" (3/4) ... [2022-11-25 16:49:35,363 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 16:49:35,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-11-25 16:49:35,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-11-25 16:49:35,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-25 16:49:35,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 16:49:35,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-11-25 16:49:35,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-25 16:49:35,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-25 16:49:35,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-25 16:49:35,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-25 16:49:35,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-25 16:49:35,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-25 16:49:35,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-25 16:49:35,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-11-25 16:49:35,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-11-25 16:49:35,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-25 16:49:35,382 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2022-11-25 16:49:35,383 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-25 16:49:35,384 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 16:49:35,385 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 16:49:35,386 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:49:35,415 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ref_cnt == 0) || !(\old(ldv_count_2) == 0)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) [2022-11-25 16:49:35,468 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:49:35,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:49:35,468 INFO L158 Benchmark]: Toolchain (without parser) took 32370.64ms. Allocated memory was 123.7MB in the beginning and 408.9MB in the end (delta: 285.2MB). Free memory was 92.8MB in the beginning and 230.8MB in the end (delta: -138.0MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,469 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:49:35,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 896.00ms. Allocated memory is still 123.7MB. Free memory was 92.3MB in the beginning and 59.5MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.36ms. Allocated memory is still 123.7MB. Free memory was 59.5MB in the beginning and 55.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,470 INFO L158 Benchmark]: Boogie Preprocessor took 122.55ms. Allocated memory is still 123.7MB. Free memory was 55.4MB in the beginning and 51.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,470 INFO L158 Benchmark]: RCFGBuilder took 1326.84ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 51.6MB in the beginning and 91.5MB in the end (delta: -39.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,471 INFO L158 Benchmark]: TraceAbstraction took 29804.66ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 90.4MB in the beginning and 241.3MB in the end (delta: -150.9MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,471 INFO L158 Benchmark]: Witness Printer took 108.47ms. Allocated memory is still 408.9MB. Free memory was 241.3MB in the beginning and 230.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:49:35,473 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.31ms. Allocated memory is still 123.7MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 896.00ms. Allocated memory is still 123.7MB. Free memory was 92.3MB in the beginning and 59.5MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.36ms. Allocated memory is still 123.7MB. Free memory was 59.5MB in the beginning and 55.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.55ms. Allocated memory is still 123.7MB. Free memory was 55.4MB in the beginning and 51.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1326.84ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 51.6MB in the beginning and 91.5MB in the end (delta: -39.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 29804.66ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 90.4MB in the beginning and 241.3MB in the end (delta: -150.9MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. * Witness Printer took 108.47ms. Allocated memory is still 408.9MB. Free memory was 241.3MB in the beginning and 230.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 1381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1114]: 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: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1128]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1128]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1223]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1223]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1233]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1233]: 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 16 procedures, 210 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5253 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4872 mSDsluCounter, 12203 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7692 mSDsCounter, 1229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4054 IncrementalHoareTripleChecker+Invalid, 5283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1229 mSolverCounterUnsat, 4511 mSDtfsCounter, 4054 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1457 GetRequests, 1368 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2550 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 1131 PreInvPairs, 1247 NumberOfFragments, 1420 HoareAnnotationTreeSize, 1131 FomulaSimplifications, 28656 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 84 FomulaSimplificationsInter, 26748 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2286 NumberOfCodeBlocks, 2286 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2586 ConstructedInterpolants, 0 QuantifiedInterpolants, 5026 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5484 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 815/879 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 14 specifications checked. All of them hold - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= i) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1146]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && i <= 2147483646) && 1 <= i) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 1342]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && (((ldv_state_variable_1 == 1 && 1 <= i) && i < 2147483646) || (i == 0 && ldv_state_variable_1 == 1))) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1443]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1306]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: (((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ((((ldv_count_1 <= 0 && i < 2147483646) && 1 <= i) && ldv_count_2 == 0) || ((ldv_count_1 <= 0 && i == 0) && ldv_count_2 == 0))) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 1413]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && i <= 2147483646) && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1450]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1440]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1429]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1406]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1013]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && i <= 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) || ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3)) || (((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 1322]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1192]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && i <= 2147483646) && 1 <= i) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 1423]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1393]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: ((((!(ref_cnt == 0) || !(\old(ldv_count_2) == 0)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 16:49:35,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94d879d6-ea46-4d95-add9-43662437c538/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE