./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:24:53,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:24:53,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:24:53,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:24:53,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:24:53,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:24:53,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:24:53,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:24:53,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:24:53,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:24:53,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:24:53,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:24:53,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:24:53,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:24:53,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:24:53,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:24:53,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:24:53,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:24:53,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:24:53,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:24:53,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:24:53,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:24:53,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:24:53,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:24:53,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:24:53,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:24:53,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:24:53,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:24:53,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:24:53,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:24:53,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:24:53,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:24:53,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:24:53,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:24:53,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:24:53,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:24:53,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:24:53,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:24:53,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:24:53,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:24:53,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:24:53,992 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 11:24:54,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:24:54,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:24:54,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:24:54,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:24:54,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:24:54,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:24:54,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:24:54,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:24:54,044 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:24:54,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:24:54,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:24:54,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:24:54,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:24:54,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:24:54,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:24:54,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:24:54,047 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 11:24:54,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:24:54,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:24:54,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:24:54,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:24:54,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:24:54,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:24:54,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:24:54,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:24:54,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:24:54,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:24:54,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:24:54,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:24:54,052 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:24:54,052 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:24:54,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:24:54,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2022-11-20 11:24:54,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:24:54,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:24:54,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:24:54,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:24:54,457 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:24:54,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-11-20 11:24:57,650 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:24:58,146 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:24:58,147 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-11-20 11:24:58,182 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/data/e9e059e24/d56fe20e3f914a519953e5acfdf8d62a/FLAG429398443 [2022-11-20 11:24:58,204 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/data/e9e059e24/d56fe20e3f914a519953e5acfdf8d62a [2022-11-20 11:24:58,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:24:58,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:24:58,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:24:58,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:24:58,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:24:58,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:24:58" (1/1) ... [2022-11-20 11:24:58,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6913be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:58, skipping insertion in model container [2022-11-20 11:24:58,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:24:58" (1/1) ... [2022-11-20 11:24:58,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:24:58,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:24:59,064 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_d3bdbc6e-137f-4138-adc9-730f294f5836/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2022-11-20 11:24:59,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:24:59,191 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:24:59,311 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_d3bdbc6e-137f-4138-adc9-730f294f5836/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2022-11-20 11:24:59,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:24:59,389 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:24:59,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59 WrapperNode [2022-11-20 11:24:59,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:24:59,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:24:59,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:24:59,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:24:59,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,477 INFO L138 Inliner]: procedures = 99, calls = 345, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 750 [2022-11-20 11:24:59,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:24:59,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:24:59,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:24:59,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:24:59,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:24:59,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:24:59,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:24:59,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:24:59,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (1/1) ... [2022-11-20 11:24:59,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:24:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:59,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:24:59,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:24:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2022-11-20 11:24:59,651 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2022-11-20 11:24:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 11:24:59,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 11:24:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:24:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-20 11:24:59,652 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-20 11:24:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 11:24:59,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 11:24:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2022-11-20 11:24:59,653 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2022-11-20 11:24:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:24:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-11-20 11:24:59,653 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-11-20 11:24:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:24:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:24:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:24:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:24:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2022-11-20 11:24:59,654 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2022-11-20 11:24:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:24:59,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-11-20 11:24:59,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-11-20 11:24:59,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:24:59,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:24:59,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-11-20 11:24:59,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-11-20 11:24:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:24:59,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:24:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-20 11:24:59,656 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-20 11:24:59,918 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:24:59,925 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:25:01,010 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:25:01,030 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:25:01,031 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:25:01,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:01 BoogieIcfgContainer [2022-11-20 11:25:01,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:25:01,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:25:01,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:25:01,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:25:01,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:24:58" (1/3) ... [2022-11-20 11:25:01,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0f0c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:01, skipping insertion in model container [2022-11-20 11:25:01,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:59" (2/3) ... [2022-11-20 11:25:01,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0f0c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:01, skipping insertion in model container [2022-11-20 11:25:01,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:01" (3/3) ... [2022-11-20 11:25:01,050 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-11-20 11:25:01,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:25:01,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-20 11:25:01,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:25:01,172 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;@42c476b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:25:01,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-20 11:25:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 161 states have internal predecessors, (206), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-20 11:25:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:25:01,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:01,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:01,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1444456607, now seen corresponding path program 1 times [2022-11-20 11:25:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:01,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343040392] [2022-11-20 11:25:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:01,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343040392] [2022-11-20 11:25:01,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343040392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:01,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:01,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744031539] [2022-11-20 11:25:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:01,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:01,858 INFO L87 Difference]: Start difference. First operand has 192 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 161 states have internal predecessors, (206), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:02,146 INFO L93 Difference]: Finished difference Result 497 states and 696 transitions. [2022-11-20 11:25:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:02,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-20 11:25:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:02,173 INFO L225 Difference]: With dead ends: 497 [2022-11-20 11:25:02,173 INFO L226 Difference]: Without dead ends: 272 [2022-11-20 11:25:02,178 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-20 11:25:02,187 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 501 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:02,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 501 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-20 11:25:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-20 11:25:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 220 states have internal predecessors, (291), 34 states have call successors, (34), 17 states have call predecessors, (34), 17 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-20 11:25:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2022-11-20 11:25:02,371 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 15 [2022-11-20 11:25:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:02,373 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2022-11-20 11:25:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2022-11-20 11:25:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:25:02,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:02,377 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] [2022-11-20 11:25:02,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:25:02,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2072638708, now seen corresponding path program 1 times [2022-11-20 11:25:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:02,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270730867] [2022-11-20 11:25:02,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:25:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:02,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270730867] [2022-11-20 11:25:02,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270730867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:02,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:02,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827648080] [2022-11-20 11:25:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:02,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:02,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:02,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:02,787 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:02,909 INFO L93 Difference]: Finished difference Result 541 states and 715 transitions. [2022-11-20 11:25:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:02,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2022-11-20 11:25:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:02,922 INFO L225 Difference]: With dead ends: 541 [2022-11-20 11:25:02,923 INFO L226 Difference]: Without dead ends: 537 [2022-11-20 11:25:02,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 11:25:02,925 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:02,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 453 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-20 11:25:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2022-11-20 11:25:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 419 states have (on average 1.3723150357995226) internal successors, (575), 428 states have internal predecessors, (575), 68 states have call successors, (68), 34 states have call predecessors, (68), 34 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-20 11:25:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 711 transitions. [2022-11-20 11:25:03,008 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 711 transitions. Word has length 26 [2022-11-20 11:25:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:03,009 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 711 transitions. [2022-11-20 11:25:03,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 711 transitions. [2022-11-20 11:25:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:25:03,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:03,020 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:03,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:25:03,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash -482153609, now seen corresponding path program 1 times [2022-11-20 11:25:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:03,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716009797] [2022-11-20 11:25:03,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:03,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 11:25:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:25:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:03,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716009797] [2022-11-20 11:25:03,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716009797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:03,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:03,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:03,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142922507] [2022-11-20 11:25:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:03,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:03,183 INFO L87 Difference]: Start difference. First operand 531 states and 711 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:25:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:03,774 INFO L93 Difference]: Finished difference Result 1179 states and 1583 transitions. [2022-11-20 11:25:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:03,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-20 11:25:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:03,781 INFO L225 Difference]: With dead ends: 1179 [2022-11-20 11:25:03,781 INFO L226 Difference]: Without dead ends: 651 [2022-11-20 11:25:03,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:03,785 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 204 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:03,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 680 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:25:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-11-20 11:25:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 626. [2022-11-20 11:25:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 493 states have (on average 1.3671399594320486) internal successors, (674), 502 states have internal predecessors, (674), 80 states have call successors, (80), 43 states have call predecessors, (80), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-20 11:25:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 834 transitions. [2022-11-20 11:25:03,829 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 834 transitions. Word has length 36 [2022-11-20 11:25:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:03,829 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 834 transitions. [2022-11-20 11:25:03,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 11:25:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 834 transitions. [2022-11-20 11:25:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:25:03,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:03,832 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] [2022-11-20 11:25:03,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:25:03,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash 888153265, now seen corresponding path program 1 times [2022-11-20 11:25:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:03,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714322409] [2022-11-20 11:25:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:25:04,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:04,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714322409] [2022-11-20 11:25:04,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714322409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:04,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:04,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505342150] [2022-11-20 11:25:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:04,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:04,070 INFO L87 Difference]: Start difference. First operand 626 states and 834 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:04,569 INFO L93 Difference]: Finished difference Result 1300 states and 1729 transitions. [2022-11-20 11:25:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:04,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2022-11-20 11:25:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:04,576 INFO L225 Difference]: With dead ends: 1300 [2022-11-20 11:25:04,576 INFO L226 Difference]: Without dead ends: 920 [2022-11-20 11:25:04,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:04,580 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 269 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:04,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 929 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:25:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-20 11:25:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 630. [2022-11-20 11:25:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 497 states have (on average 1.364185110663984) internal successors, (678), 506 states have internal predecessors, (678), 80 states have call successors, (80), 43 states have call predecessors, (80), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-20 11:25:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 838 transitions. [2022-11-20 11:25:04,638 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 838 transitions. Word has length 39 [2022-11-20 11:25:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:04,638 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 838 transitions. [2022-11-20 11:25:04,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 838 transitions. [2022-11-20 11:25:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:25:04,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:04,641 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:25:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:25:04,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1659416553, now seen corresponding path program 1 times [2022-11-20 11:25:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:04,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234010479] [2022-11-20 11:25:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:25:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:04,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234010479] [2022-11-20 11:25:04,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234010479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:04,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:04,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120612030] [2022-11-20 11:25:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:04,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:04,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:04,949 INFO L87 Difference]: Start difference. First operand 630 states and 838 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 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-20 11:25:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:05,489 INFO L93 Difference]: Finished difference Result 1212 states and 1624 transitions. [2022-11-20 11:25:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 51 [2022-11-20 11:25:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:05,496 INFO L225 Difference]: With dead ends: 1212 [2022-11-20 11:25:05,496 INFO L226 Difference]: Without dead ends: 685 [2022-11-20 11:25:05,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:05,499 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 29 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:05,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 514 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:25:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-20 11:25:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 660. [2022-11-20 11:25:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 523 states have (on average 1.349904397705545) internal successors, (706), 532 states have internal predecessors, (706), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-20 11:25:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-11-20 11:25:05,563 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 51 [2022-11-20 11:25:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:05,564 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-11-20 11:25:05,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 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-20 11:25:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-11-20 11:25:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 11:25:05,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:05,567 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:25:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:25:05,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash -757179182, now seen corresponding path program 1 times [2022-11-20 11:25:05,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:05,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267871427] [2022-11-20 11:25:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 11:25:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:25:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:05,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267871427] [2022-11-20 11:25:05,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267871427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:05,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:05,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313860918] [2022-11-20 11:25:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:05,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:05,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:05,890 INFO L87 Difference]: Start difference. First operand 660 states and 874 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 11:25:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:07,018 INFO L93 Difference]: Finished difference Result 1546 states and 2136 transitions. [2022-11-20 11:25:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2022-11-20 11:25:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:07,025 INFO L225 Difference]: With dead ends: 1546 [2022-11-20 11:25:07,025 INFO L226 Difference]: Without dead ends: 989 [2022-11-20 11:25:07,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:07,028 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 143 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:07,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1002 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 11:25:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-11-20 11:25:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 662. [2022-11-20 11:25:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 525 states have (on average 1.3485714285714285) internal successors, (708), 534 states have internal predecessors, (708), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-20 11:25:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 876 transitions. [2022-11-20 11:25:07,091 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 876 transitions. Word has length 61 [2022-11-20 11:25:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:07,092 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 876 transitions. [2022-11-20 11:25:07,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 11:25:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 876 transitions. [2022-11-20 11:25:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 11:25:07,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:07,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:07,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:25:07,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash 550582253, now seen corresponding path program 1 times [2022-11-20 11:25:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825822022] [2022-11-20 11:25:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:25:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:25:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 11:25:07,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:07,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825822022] [2022-11-20 11:25:07,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825822022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:07,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:07,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:07,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004426489] [2022-11-20 11:25:07,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:07,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:07,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:07,378 INFO L87 Difference]: Start difference. First operand 662 states and 876 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 11:25:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:08,200 INFO L93 Difference]: Finished difference Result 989 states and 1397 transitions. [2022-11-20 11:25:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-11-20 11:25:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:08,207 INFO L225 Difference]: With dead ends: 989 [2022-11-20 11:25:08,207 INFO L226 Difference]: Without dead ends: 987 [2022-11-20 11:25:08,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:08,209 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 151 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:08,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 707 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:25:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-11-20 11:25:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 660. [2022-11-20 11:25:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 525 states have (on average 1.340952380952381) internal successors, (704), 532 states have internal predecessors, (704), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-20 11:25:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 872 transitions. [2022-11-20 11:25:08,268 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 872 transitions. Word has length 71 [2022-11-20 11:25:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:08,269 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 872 transitions. [2022-11-20 11:25:08,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 11:25:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 872 transitions. [2022-11-20 11:25:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 11:25:08,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:08,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:08,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:25:08,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash -111819200, now seen corresponding path program 1 times [2022-11-20 11:25:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:08,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127749841] [2022-11-20 11:25:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:08,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 11:25:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:25:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 11:25:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:08,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127749841] [2022-11-20 11:25:08,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127749841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:08,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911999896] [2022-11-20 11:25:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:08,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:08,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:25:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:09,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:25:09,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 11:25:09,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911999896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:09,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:25:09,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 11:25:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861280481] [2022-11-20 11:25:09,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:09,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:09,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:09,163 INFO L87 Difference]: Start difference. First operand 660 states and 872 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:25:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:09,659 INFO L93 Difference]: Finished difference Result 1523 states and 2092 transitions. [2022-11-20 11:25:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2022-11-20 11:25:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:09,665 INFO L225 Difference]: With dead ends: 1523 [2022-11-20 11:25:09,665 INFO L226 Difference]: Without dead ends: 966 [2022-11-20 11:25:09,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:09,667 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 246 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:09,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 575 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:25:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-11-20 11:25:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 660. [2022-11-20 11:25:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 527 states have (on average 1.3282732447817838) internal successors, (700), 532 states have internal predecessors, (700), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-20 11:25:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 868 transitions. [2022-11-20 11:25:09,724 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 868 transitions. Word has length 72 [2022-11-20 11:25:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:09,724 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 868 transitions. [2022-11-20 11:25:09,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 11:25:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 868 transitions. [2022-11-20 11:25:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 11:25:09,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:09,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:09,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:09,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:09,936 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1584626497, now seen corresponding path program 1 times [2022-11-20 11:25:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:09,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670265298] [2022-11-20 11:25:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:25:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 11:25:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:10,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670265298] [2022-11-20 11:25:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670265298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:10,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:10,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:10,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53327910] [2022-11-20 11:25:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:10,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:10,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:10,242 INFO L87 Difference]: Start difference. First operand 660 states and 868 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 11:25:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:10,660 INFO L93 Difference]: Finished difference Result 1084 states and 1433 transitions. [2022-11-20 11:25:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:10,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2022-11-20 11:25:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:10,664 INFO L225 Difference]: With dead ends: 1084 [2022-11-20 11:25:10,664 INFO L226 Difference]: Without dead ends: 691 [2022-11-20 11:25:10,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:10,671 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 29 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:10,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 522 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:25:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-11-20 11:25:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 666. [2022-11-20 11:25:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 532 states have (on average 1.3251879699248121) internal successors, (705), 537 states have internal predecessors, (705), 85 states have call successors, (85), 43 states have call predecessors, (85), 43 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-11-20 11:25:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 875 transitions. [2022-11-20 11:25:10,723 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 875 transitions. Word has length 77 [2022-11-20 11:25:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:10,723 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 875 transitions. [2022-11-20 11:25:10,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 11:25:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 875 transitions. [2022-11-20 11:25:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 11:25:10,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:10,733 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:10,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:25:10,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash -586388578, now seen corresponding path program 1 times [2022-11-20 11:25:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:10,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941979274] [2022-11-20 11:25:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:25:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:25:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 11:25:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941979274] [2022-11-20 11:25:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941979274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972332188] [2022-11-20 11:25:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:11,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:11,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:11,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:11,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:25:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:11,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:25:11,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:25:11,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 11:25:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972332188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:11,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:25:11,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-11-20 11:25:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496495886] [2022-11-20 11:25:11,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:11,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:25:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:25:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:11,901 INFO L87 Difference]: Start difference. First operand 666 states and 875 transitions. Second operand has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 8 states have internal predecessors, (196), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-11-20 11:25:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:13,277 INFO L93 Difference]: Finished difference Result 2096 states and 2783 transitions. [2022-11-20 11:25:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:25:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 8 states have internal predecessors, (196), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 86 [2022-11-20 11:25:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:13,287 INFO L225 Difference]: With dead ends: 2096 [2022-11-20 11:25:13,287 INFO L226 Difference]: Without dead ends: 1697 [2022-11-20 11:25:13,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:25:13,290 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 1341 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:13,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 994 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 11:25:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-11-20 11:25:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1231. [2022-11-20 11:25:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 990 states have (on average 1.3181818181818181) internal successors, (1305), 994 states have internal predecessors, (1305), 158 states have call successors, (158), 78 states have call predecessors, (158), 78 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2022-11-20 11:25:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1621 transitions. [2022-11-20 11:25:13,436 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1621 transitions. Word has length 86 [2022-11-20 11:25:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:13,436 INFO L495 AbstractCegarLoop]: Abstraction has 1231 states and 1621 transitions. [2022-11-20 11:25:13,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.77777777777778) internal successors, (196), 8 states have internal predecessors, (196), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-11-20 11:25:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1621 transitions. [2022-11-20 11:25:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 11:25:13,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:13,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:13,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:13,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:13,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash 753227037, now seen corresponding path program 1 times [2022-11-20 11:25:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:13,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019603686] [2022-11-20 11:25:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:25:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:25:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 11:25:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:25:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:13,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019603686] [2022-11-20 11:25:13,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019603686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:13,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892824974] [2022-11-20 11:25:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:13,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:13,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:13,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:13,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:25:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:14,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:25:14,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:25:14,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:14,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892824974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:14,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:25:14,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 11:25:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079522778] [2022-11-20 11:25:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:14,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:14,438 INFO L87 Difference]: Start difference. First operand 1231 states and 1621 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:25:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:14,652 INFO L93 Difference]: Finished difference Result 1750 states and 2418 transitions. [2022-11-20 11:25:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:14,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2022-11-20 11:25:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:14,661 INFO L225 Difference]: With dead ends: 1750 [2022-11-20 11:25:14,661 INFO L226 Difference]: Without dead ends: 1749 [2022-11-20 11:25:14,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:14,663 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 276 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:14,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 602 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2022-11-20 11:25:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1230. [2022-11-20 11:25:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 990 states have (on average 1.316161616161616) internal successors, (1303), 993 states have internal predecessors, (1303), 158 states have call successors, (158), 78 states have call predecessors, (158), 78 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2022-11-20 11:25:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1619 transitions. [2022-11-20 11:25:14,769 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1619 transitions. Word has length 91 [2022-11-20 11:25:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:14,769 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1619 transitions. [2022-11-20 11:25:14,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 11:25:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1619 transitions. [2022-11-20 11:25:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 11:25:14,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:14,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:14,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:14,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:25:14,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1673718044, now seen corresponding path program 1 times [2022-11-20 11:25:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:14,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002058889] [2022-11-20 11:25:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:25:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:25:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 11:25:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 11:25:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:15,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002058889] [2022-11-20 11:25:15,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002058889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589096286] [2022-11-20 11:25:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:15,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:15,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:15,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:25:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:25:15,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 11:25:16,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:16,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589096286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:16,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:25:16,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 11:25:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714493701] [2022-11-20 11:25:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:16,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:16,083 INFO L87 Difference]: Start difference. First operand 1230 states and 1619 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 11:25:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:16,314 INFO L93 Difference]: Finished difference Result 1394 states and 1834 transitions. [2022-11-20 11:25:16,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:16,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 96 [2022-11-20 11:25:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:16,322 INFO L225 Difference]: With dead ends: 1394 [2022-11-20 11:25:16,323 INFO L226 Difference]: Without dead ends: 1392 [2022-11-20 11:25:16,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:16,325 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 342 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:16,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 554 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-11-20 11:25:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1064. [2022-11-20 11:25:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 855 states have (on average 1.3169590643274853) internal successors, (1126), 856 states have internal predecessors, (1126), 138 states have call successors, (138), 69 states have call predecessors, (138), 69 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-11-20 11:25:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1402 transitions. [2022-11-20 11:25:16,445 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1402 transitions. Word has length 96 [2022-11-20 11:25:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:16,445 INFO L495 AbstractCegarLoop]: Abstraction has 1064 states and 1402 transitions. [2022-11-20 11:25:16,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 11:25:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1402 transitions. [2022-11-20 11:25:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 11:25:16,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:16,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:16,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:16,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:25:16,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1994966859, now seen corresponding path program 1 times [2022-11-20 11:25:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:16,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912821466] [2022-11-20 11:25:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:25:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:25:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 11:25:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 11:25:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 11:25:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:16,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912821466] [2022-11-20 11:25:16,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912821466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:16,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:16,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373664931] [2022-11-20 11:25:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:16,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:16,900 INFO L87 Difference]: Start difference. First operand 1064 states and 1402 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 11:25:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:17,278 INFO L93 Difference]: Finished difference Result 1104 states and 1461 transitions. [2022-11-20 11:25:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:17,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 99 [2022-11-20 11:25:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:17,285 INFO L225 Difference]: With dead ends: 1104 [2022-11-20 11:25:17,285 INFO L226 Difference]: Without dead ends: 1103 [2022-11-20 11:25:17,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:17,287 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 26 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:17,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 507 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:25:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-11-20 11:25:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1055. [2022-11-20 11:25:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 849 states have (on average 1.3168433451118964) internal successors, (1118), 849 states have internal predecessors, (1118), 136 states have call successors, (136), 69 states have call predecessors, (136), 69 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2022-11-20 11:25:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1390 transitions. [2022-11-20 11:25:17,385 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1390 transitions. Word has length 99 [2022-11-20 11:25:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:17,386 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1390 transitions. [2022-11-20 11:25:17,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 11:25:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1390 transitions. [2022-11-20 11:25:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-20 11:25:17,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:17,391 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:17,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:25:17,392 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash -134700621, now seen corresponding path program 1 times [2022-11-20 11:25:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:17,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797419851] [2022-11-20 11:25:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:17,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 11:25:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 11:25:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:25:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-20 11:25:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 11:25:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:25:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-11-20 11:25:17,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:17,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797419851] [2022-11-20 11:25:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797419851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:17,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:17,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:17,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105430594] [2022-11-20 11:25:17,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:17,734 INFO L87 Difference]: Start difference. First operand 1055 states and 1390 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 11:25:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:18,365 INFO L93 Difference]: Finished difference Result 1837 states and 2422 transitions. [2022-11-20 11:25:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:18,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 148 [2022-11-20 11:25:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:18,370 INFO L225 Difference]: With dead ends: 1837 [2022-11-20 11:25:18,370 INFO L226 Difference]: Without dead ends: 885 [2022-11-20 11:25:18,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:18,373 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 172 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:18,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 704 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:25:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-20 11:25:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 855. [2022-11-20 11:25:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 693 states have (on average 1.2987012987012987) internal successors, (900), 693 states have internal predecessors, (900), 108 states have call successors, (108), 53 states have call predecessors, (108), 53 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2022-11-20 11:25:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1116 transitions. [2022-11-20 11:25:18,455 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1116 transitions. Word has length 148 [2022-11-20 11:25:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:18,455 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1116 transitions. [2022-11-20 11:25:18,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 11:25:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1116 transitions. [2022-11-20 11:25:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-20 11:25:18,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:18,460 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, 2, 2, 1, 1, 1, 1] [2022-11-20 11:25:18,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:25:18,461 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-20 11:25:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash -450540211, now seen corresponding path program 2 times [2022-11-20 11:25:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810951500] [2022-11-20 11:25:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:25:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:25:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 11:25:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 11:25:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 11:25:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:25:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-20 11:25:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-20 11:25:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-20 11:25:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-20 11:25:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810951500] [2022-11-20 11:25:18,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810951500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:18,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:18,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220894154] [2022-11-20 11:25:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:18,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:18,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:18,856 INFO L87 Difference]: Start difference. First operand 855 states and 1116 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 11:25:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:19,294 INFO L93 Difference]: Finished difference Result 1157 states and 1512 transitions. [2022-11-20 11:25:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:19,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 170 [2022-11-20 11:25:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:19,296 INFO L225 Difference]: With dead ends: 1157 [2022-11-20 11:25:19,296 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:25:19,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:19,299 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 180 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:19,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 617 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:25:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:25:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:25:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:25:19,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2022-11-20 11:25:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:19,302 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:25:19,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 11:25:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:25:19,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:25:19,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-20 11:25:19,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-20 11:25:19,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-20 11:25:19,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-20 11:25:19,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-20 11:25:19,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-20 11:25:19,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-20 11:25:19,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-20 11:25:19,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-20 11:25:19,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-20 11:25:19,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:25:19,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:25:23,833 INFO L899 garLoopResultBuilder]: For program point L2945(lines 2945 2948) no Hoare annotation was computed. [2022-11-20 11:25:23,833 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicEXIT(lines 2942 2952) no Hoare annotation was computed. [2022-11-20 11:25:23,833 INFO L899 garLoopResultBuilder]: For program point L2947-1(lines 2945 2948) no Hoare annotation was computed. [2022-11-20 11:25:23,833 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_lock_mtx_of_isl_pmicENTRY(lines 2942 2952) the Hoare annotation is: true [2022-11-20 11:25:23,834 INFO L902 garLoopResultBuilder]: At program point L2947(line 2947) the Hoare annotation is: true [2022-11-20 11:25:23,834 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicFINAL(lines 2942 2952) no Hoare annotation was computed. [2022-11-20 11:25:23,834 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_unlock_mtx_of_isl_pmicENTRY(lines 3000 3010) the Hoare annotation is: true [2022-11-20 11:25:23,834 INFO L899 garLoopResultBuilder]: For program point L3005-1(lines 3003 3006) no Hoare annotation was computed. [2022-11-20 11:25:23,834 INFO L902 garLoopResultBuilder]: At program point L3005(line 3005) the Hoare annotation is: true [2022-11-20 11:25:23,835 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicEXIT(lines 3000 3010) no Hoare annotation was computed. [2022-11-20 11:25:23,835 INFO L899 garLoopResultBuilder]: For program point L3003(lines 3003 3006) no Hoare annotation was computed. [2022-11-20 11:25:23,835 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicFINAL(lines 3000 3010) no Hoare annotation was computed. [2022-11-20 11:25:23,835 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearFINAL(lines 3204 3206) no Hoare annotation was computed. [2022-11-20 11:25:23,835 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearEXIT(lines 3204 3206) no Hoare annotation was computed. [2022-11-20 11:25:23,836 INFO L902 garLoopResultBuilder]: At program point regulator_list_voltage_linearENTRY(lines 3204 3206) the Hoare annotation is: true [2022-11-20 11:25:23,836 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 3197 3199) the Hoare annotation is: true [2022-11-20 11:25:23,836 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 3197 3199) no Hoare annotation was computed. [2022-11-20 11:25:23,836 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 3197 3199) no Hoare annotation was computed. [2022-11-20 11:25:23,837 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 3158 3164) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-11-20 11:25:23,837 INFO L902 garLoopResultBuilder]: At program point L3162(line 3162) the Hoare annotation is: true [2022-11-20 11:25:23,837 INFO L899 garLoopResultBuilder]: For program point L3160(line 3160) no Hoare annotation was computed. [2022-11-20 11:25:23,837 INFO L899 garLoopResultBuilder]: For program point L3162-1(line 3162) no Hoare annotation was computed. [2022-11-20 11:25:23,838 INFO L899 garLoopResultBuilder]: For program point L3156(line 3156) no Hoare annotation was computed. [2022-11-20 11:25:23,838 INFO L899 garLoopResultBuilder]: For program point L3155(lines 3155 3157) no Hoare annotation was computed. [2022-11-20 11:25:23,838 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 3158 3164) no Hoare annotation was computed. [2022-11-20 11:25:23,838 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 3158 3164) no Hoare annotation was computed. [2022-11-20 11:25:23,838 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2684 2689) no Hoare annotation was computed. [2022-11-20 11:25:23,839 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2684 2689) the Hoare annotation is: true [2022-11-20 11:25:23,839 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2684 2689) no Hoare annotation was computed. [2022-11-20 11:25:23,839 INFO L902 garLoopResultBuilder]: At program point regulator_unregisterENTRY(lines 3214 3216) the Hoare annotation is: true [2022-11-20 11:25:23,839 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterFINAL(lines 3214 3216) no Hoare annotation was computed. [2022-11-20 11:25:23,839 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterEXIT(lines 3214 3216) no Hoare annotation was computed. [2022-11-20 11:25:23,840 INFO L902 garLoopResultBuilder]: At program point mutex_lockENTRY(lines 3190 3192) the Hoare annotation is: true [2022-11-20 11:25:23,840 INFO L899 garLoopResultBuilder]: For program point mutex_lockFINAL(lines 3190 3192) no Hoare annotation was computed. [2022-11-20 11:25:23,840 INFO L899 garLoopResultBuilder]: For program point mutex_lockEXIT(lines 3190 3192) no Hoare annotation was computed. [2022-11-20 11:25:23,840 INFO L899 garLoopResultBuilder]: For program point L2529(lines 2529 2533) no Hoare annotation was computed. [2022-11-20 11:25:23,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-11-20 11:25:23,841 INFO L895 garLoopResultBuilder]: At program point L2397(lines 2378 2399) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-20 11:25:23,841 INFO L895 garLoopResultBuilder]: At program point L2678(line 2678) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,841 INFO L895 garLoopResultBuilder]: At program point L2678-1(line 2678) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,841 INFO L899 garLoopResultBuilder]: For program point L2480(line 2480) no Hoare annotation was computed. [2022-11-20 11:25:23,842 INFO L895 garLoopResultBuilder]: At program point L2249(lines 2245 2251) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,842 INFO L895 garLoopResultBuilder]: At program point L2662(line 2662) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,842 INFO L895 garLoopResultBuilder]: At program point L2662-1(line 2662) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,843 INFO L895 garLoopResultBuilder]: At program point L2530(line 2530) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,843 INFO L899 garLoopResultBuilder]: For program point L2563(line 2563) no Hoare annotation was computed. [2022-11-20 11:25:23,843 INFO L899 garLoopResultBuilder]: For program point L2464(lines 2464 2468) no Hoare annotation was computed. [2022-11-20 11:25:23,843 INFO L899 garLoopResultBuilder]: For program point L2530-1(line 2530) no Hoare annotation was computed. [2022-11-20 11:25:23,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:25:23,844 INFO L895 garLoopResultBuilder]: At program point L2266(lines 2252 2268) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,844 INFO L895 garLoopResultBuilder]: At program point L2233(lines 2229 2235) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,844 INFO L895 garLoopResultBuilder]: At program point L2679(lines 2675 2682) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,844 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-11-20 11:25:23,845 INFO L895 garLoopResultBuilder]: At program point L2283(lines 2269 2285) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,845 INFO L895 garLoopResultBuilder]: At program point L2663(lines 2659 2666) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,845 INFO L899 garLoopResultBuilder]: For program point L2564(lines 2564 2579) no Hoare annotation was computed. [2022-11-20 11:25:23,845 INFO L895 garLoopResultBuilder]: At program point L2366(line 2366) the Hoare annotation is: (and (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (<= 0 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,846 INFO L899 garLoopResultBuilder]: For program point L2366-1(line 2366) no Hoare annotation was computed. [2022-11-20 11:25:23,846 INFO L899 garLoopResultBuilder]: For program point L3126(lines 3126 3129) no Hoare annotation was computed. [2022-11-20 11:25:23,846 INFO L899 garLoopResultBuilder]: For program point L2581(line 2581) no Hoare annotation was computed. [2022-11-20 11:25:23,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-11-20 11:25:23,846 INFO L902 garLoopResultBuilder]: At program point L3176(lines 3175 3177) the Hoare annotation is: true [2022-11-20 11:25:23,847 INFO L895 garLoopResultBuilder]: At program point L3209(lines 3208 3210) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,847 INFO L899 garLoopResultBuilder]: For program point L2466(line 2466) no Hoare annotation was computed. [2022-11-20 11:25:23,847 INFO L899 garLoopResultBuilder]: For program point L2499(line 2499) no Hoare annotation was computed. [2022-11-20 11:25:23,847 INFO L899 garLoopResultBuilder]: For program point L2466-1(line 2466) no Hoare annotation was computed. [2022-11-20 11:25:23,848 INFO L895 garLoopResultBuilder]: At program point L2367(lines 2310 2376) the Hoare annotation is: (and (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (<= 0 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,848 INFO L895 garLoopResultBuilder]: At program point L2169(lines 2166 2171) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-11-20 11:25:23,848 INFO L899 garLoopResultBuilder]: For program point L2549(line 2549) no Hoare annotation was computed. [2022-11-20 11:25:23,848 INFO L899 garLoopResultBuilder]: For program point L2566(lines 2566 2576) no Hoare annotation was computed. [2022-11-20 11:25:23,848 INFO L899 garLoopResultBuilder]: For program point L2500(lines 2500 2515) no Hoare annotation was computed. [2022-11-20 11:25:23,849 INFO L899 garLoopResultBuilder]: For program point L2368(line 2368) no Hoare annotation was computed. [2022-11-20 11:25:23,849 INFO L902 garLoopResultBuilder]: At program point L3128(line 3128) the Hoare annotation is: true [2022-11-20 11:25:23,849 INFO L899 garLoopResultBuilder]: For program point L2550(lines 2550 2554) no Hoare annotation was computed. [2022-11-20 11:25:23,849 INFO L899 garLoopResultBuilder]: For program point L3128-1(lines 3125 3143) no Hoare annotation was computed. [2022-11-20 11:25:23,849 INFO L899 garLoopResultBuilder]: For program point L2517(line 2517) no Hoare annotation was computed. [2022-11-20 11:25:23,850 INFO L895 garLoopResultBuilder]: At program point L2418(lines 2414 2420) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-11-20 11:25:23,850 INFO L899 garLoopResultBuilder]: For program point L2567(line 2567) no Hoare annotation was computed. [2022-11-20 11:25:23,850 INFO L899 garLoopResultBuilder]: For program point L2369(lines 2369 2373) no Hoare annotation was computed. [2022-11-20 11:25:23,850 INFO L895 garLoopResultBuilder]: At program point L2584(lines 2447 2589) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,851 INFO L899 garLoopResultBuilder]: For program point L2353-1(line 2353) no Hoare annotation was computed. [2022-11-20 11:25:23,851 INFO L899 garLoopResultBuilder]: For program point L2353(line 2353) no Hoare annotation was computed. [2022-11-20 11:25:23,851 INFO L895 garLoopResultBuilder]: At program point L3212(line 3212) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-11-20 11:25:23,851 INFO L895 garLoopResultBuilder]: At program point L3146(lines 3145 3147) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,852 INFO L895 garLoopResultBuilder]: At program point L3212-2(lines 3211 3213) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-11-20 11:25:23,852 INFO L899 garLoopResultBuilder]: For program point L3212-1(line 3212) no Hoare annotation was computed. [2022-11-20 11:25:23,852 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2572) no Hoare annotation was computed. [2022-11-20 11:25:23,852 INFO L899 garLoopResultBuilder]: For program point L2502(lines 2502 2508) no Hoare annotation was computed. [2022-11-20 11:25:23,852 INFO L899 garLoopResultBuilder]: For program point L2535(line 2535) no Hoare annotation was computed. [2022-11-20 11:25:23,852 INFO L899 garLoopResultBuilder]: For program point L2502-2(lines 2500 2514) no Hoare annotation was computed. [2022-11-20 11:25:23,853 INFO L895 garLoopResultBuilder]: At program point L2370(lines 2310 2376) the Hoare annotation is: (and (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (<= 0 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:25:23,853 INFO L899 garLoopResultBuilder]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2022-11-20 11:25:23,853 INFO L899 garLoopResultBuilder]: For program point L2337-2(lines 2337 2341) no Hoare annotation was computed. [2022-11-20 11:25:23,854 INFO L895 garLoopResultBuilder]: At program point L2354(lines 2310 2376) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-11-20 11:25:23,854 INFO L899 garLoopResultBuilder]: For program point L2321(lines 2321 2324) no Hoare annotation was computed. [2022-11-20 11:25:23,854 INFO L895 garLoopResultBuilder]: At program point L3180(lines 3179 3181) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-11-20 11:25:23,854 INFO L899 garLoopResultBuilder]: For program point L2536(lines 2536 2540) no Hoare annotation was computed. [2022-11-20 11:25:23,854 INFO L899 garLoopResultBuilder]: For program point L2569-1(line 2569) no Hoare annotation was computed. [2022-11-20 11:25:23,855 INFO L895 garLoopResultBuilder]: At program point L2569(line 2569) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,855 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-11-20 11:25:23,855 INFO L899 garLoopResultBuilder]: For program point L2487(line 2487) no Hoare annotation was computed. [2022-11-20 11:25:23,855 INFO L895 garLoopResultBuilder]: At program point L2388(line 2388) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 2)) (.cse1 (<= 1 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_0~0 3)) (.cse3 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_isl6271a_remove_~i~1#1| 0) .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_isl6271a_remove_~i~1#1| 2) (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) .cse0 .cse1 .cse2 .cse3))) [2022-11-20 11:25:23,856 INFO L899 garLoopResultBuilder]: For program point L2388-1(line 2388) no Hoare annotation was computed. [2022-11-20 11:25:23,856 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-11-20 11:25:23,856 INFO L895 garLoopResultBuilder]: At program point L2372(lines 2310 2376) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_isl6271a_probe_~i~0#1| 1) 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,856 INFO L902 garLoopResultBuilder]: At program point L3132(line 3132) the Hoare annotation is: true [2022-11-20 11:25:23,857 INFO L899 garLoopResultBuilder]: For program point L3132-1(lines 3125 3143) no Hoare annotation was computed. [2022-11-20 11:25:23,857 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2522) no Hoare annotation was computed. [2022-11-20 11:25:23,857 INFO L895 garLoopResultBuilder]: At program point L2356(lines 2310 2376) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-11-20 11:25:23,857 INFO L899 garLoopResultBuilder]: For program point L2389-1(line 2389) no Hoare annotation was computed. [2022-11-20 11:25:23,857 INFO L899 garLoopResultBuilder]: For program point L2389(line 2389) no Hoare annotation was computed. [2022-11-20 11:25:23,858 INFO L899 garLoopResultBuilder]: For program point L2257-1(line 2257) no Hoare annotation was computed. [2022-11-20 11:25:23,858 INFO L895 garLoopResultBuilder]: At program point L2257(line 2257) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,858 INFO L895 garLoopResultBuilder]: At program point L2670(line 2670) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,858 INFO L895 garLoopResultBuilder]: At program point L2670-1(line 2670) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,859 INFO L899 garLoopResultBuilder]: For program point L2472(line 2472) no Hoare annotation was computed. [2022-11-20 11:25:23,859 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-11-20 11:25:23,859 INFO L895 garLoopResultBuilder]: At program point L2274(line 2274) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,859 INFO L899 garLoopResultBuilder]: For program point L2274-1(line 2274) no Hoare annotation was computed. [2022-11-20 11:25:23,859 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-11-20 11:25:23,860 INFO L895 garLoopResultBuilder]: At program point L3166(line 3166) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-20 11:25:23,860 INFO L895 garLoopResultBuilder]: At program point L2654(line 2654) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,860 INFO L895 garLoopResultBuilder]: At program point L3166-2(lines 3165 3167) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-20 11:25:23,860 INFO L902 garLoopResultBuilder]: At program point L2588(lines 2441 2590) the Hoare annotation is: true [2022-11-20 11:25:23,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:25:23,861 INFO L899 garLoopResultBuilder]: For program point L3166-1(line 3166) no Hoare annotation was computed. [2022-11-20 11:25:23,861 INFO L895 garLoopResultBuilder]: At program point L2654-1(line 2654) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,861 INFO L899 garLoopResultBuilder]: For program point L2456(lines 2456 2583) no Hoare annotation was computed. [2022-11-20 11:25:23,861 INFO L895 garLoopResultBuilder]: At program point L2390(lines 2382 2398) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 2)) (.cse1 (<= 1 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_0~0 3)) (.cse3 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_isl6271a_remove_~i~1#1| 0) .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) .cse0 .cse1 .cse2 .cse3))) [2022-11-20 11:25:23,862 INFO L895 garLoopResultBuilder]: At program point L2671(lines 2667 2674) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,862 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2478) no Hoare annotation was computed. [2022-11-20 11:25:23,862 INFO L895 garLoopResultBuilder]: At program point L2242(lines 2238 2244) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,862 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-11-20 11:25:23,863 INFO L895 garLoopResultBuilder]: At program point L2655(lines 2651 2658) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,863 INFO L899 garLoopResultBuilder]: For program point L2556(line 2556) no Hoare annotation was computed. [2022-11-20 11:25:23,863 INFO L899 garLoopResultBuilder]: For program point L2490(lines 2490 2519) no Hoare annotation was computed. [2022-11-20 11:25:23,863 INFO L899 garLoopResultBuilder]: For program point L2457(line 2457) no Hoare annotation was computed. [2022-11-20 11:25:23,863 INFO L895 garLoopResultBuilder]: At program point L2358(lines 2310 2376) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,864 INFO L895 garLoopResultBuilder]: At program point L2226(lines 2222 2228) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-20 11:25:23,864 INFO L895 garLoopResultBuilder]: At program point L3184(lines 3183 3185) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,864 INFO L895 garLoopResultBuilder]: At program point L2375(lines 2299 2377) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,864 INFO L899 garLoopResultBuilder]: For program point L2524(line 2524) no Hoare annotation was computed. [2022-11-20 11:25:23,864 INFO L899 garLoopResultBuilder]: For program point L2458(lines 2458 2485) no Hoare annotation was computed. [2022-11-20 11:25:23,865 INFO L899 garLoopResultBuilder]: For program point L2491(line 2491) no Hoare annotation was computed. [2022-11-20 11:25:23,865 INFO L895 garLoopResultBuilder]: At program point L2392(lines 2382 2398) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 2)) (.cse1 (<= 1 ~ref_cnt~0)) (.cse2 (= ~ldv_state_variable_0~0 3)) (.cse3 (<= ~ref_cnt~0 1))) (or (and .cse0 (= |ULTIMATE.start_isl6271a_remove_~i~1#1| 0) .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_isl6271a_remove_~i~1#1| 2) (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) .cse0 .cse1 .cse2 .cse3))) [2022-11-20 11:25:23,865 INFO L902 garLoopResultBuilder]: At program point L2425(lines 2421 2427) the Hoare annotation is: true [2022-11-20 11:25:23,865 INFO L899 garLoopResultBuilder]: For program point L2574(line 2574) no Hoare annotation was computed. [2022-11-20 11:25:23,865 INFO L902 garLoopResultBuilder]: At program point L3136(line 3136) the Hoare annotation is: true [2022-11-20 11:25:23,866 INFO L899 garLoopResultBuilder]: For program point L3136-1(lines 3125 3143) no Hoare annotation was computed. [2022-11-20 11:25:23,866 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2497) no Hoare annotation was computed. [2022-11-20 11:25:23,866 INFO L899 garLoopResultBuilder]: For program point L2525(lines 2525 2561) no Hoare annotation was computed. [2022-11-20 11:25:23,866 INFO L899 garLoopResultBuilder]: For program point L2327(lines 2327 2330) no Hoare annotation was computed. [2022-11-20 11:25:23,866 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2264) no Hoare annotation was computed. [2022-11-20 11:25:23,867 INFO L899 garLoopResultBuilder]: For program point L2261-2(lines 2261 2264) no Hoare annotation was computed. [2022-11-20 11:25:23,867 INFO L895 garLoopResultBuilder]: At program point L3120(lines 3113 3122) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-11-20 11:25:23,867 INFO L899 garLoopResultBuilder]: For program point L2542(line 2542) no Hoare annotation was computed. [2022-11-20 11:25:23,867 INFO L899 garLoopResultBuilder]: For program point L2476(line 2476) no Hoare annotation was computed. [2022-11-20 11:25:23,867 INFO L899 garLoopResultBuilder]: For program point L2476-1(line 2476) no Hoare annotation was computed. [2022-11-20 11:25:23,867 INFO L899 garLoopResultBuilder]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2022-11-20 11:25:23,868 INFO L899 garLoopResultBuilder]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2022-11-20 11:25:23,868 INFO L895 garLoopResultBuilder]: At program point L3170(lines 3169 3171) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,868 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:25:23,868 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-11-20 11:25:23,868 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-11-20 11:25:23,869 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2482) no Hoare annotation was computed. [2022-11-20 11:25:23,869 INFO L895 garLoopResultBuilder]: At program point L2394(lines 2382 2398) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-11-20 11:25:23,869 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2022-11-20 11:25:23,869 INFO L899 garLoopResultBuilder]: For program point L2345-1(line 2345) no Hoare annotation was computed. [2022-11-20 11:25:23,870 INFO L895 garLoopResultBuilder]: At program point L2345(line 2345) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-11-20 11:25:23,870 INFO L899 garLoopResultBuilder]: For program point L2527(lines 2527 2558) no Hoare annotation was computed. [2022-11-20 11:25:23,870 INFO L899 garLoopResultBuilder]: For program point L2461(line 2461) no Hoare annotation was computed. [2022-11-20 11:25:23,870 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-11-20 11:25:23,870 INFO L895 garLoopResultBuilder]: At program point L3188(lines 3187 3189) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3)) (.cse1 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0) (and (= ~ldv_state_variable_1~0 0) .cse1))) [2022-11-20 11:25:23,871 INFO L902 garLoopResultBuilder]: At program point L2511(lines 2447 2589) the Hoare annotation is: true [2022-11-20 11:25:23,871 INFO L899 garLoopResultBuilder]: For program point L2346(lines 2346 2352) no Hoare annotation was computed. [2022-11-20 11:25:23,871 INFO L899 garLoopResultBuilder]: For program point L2528(line 2528) no Hoare annotation was computed. [2022-11-20 11:25:23,871 INFO L899 garLoopResultBuilder]: For program point L2462(lines 2462 2470) no Hoare annotation was computed. [2022-11-20 11:25:23,871 INFO L899 garLoopResultBuilder]: For program point L3173-1(line 3173) no Hoare annotation was computed. [2022-11-20 11:25:23,871 INFO L902 garLoopResultBuilder]: At program point L3140(line 3140) the Hoare annotation is: true [2022-11-20 11:25:23,872 INFO L895 garLoopResultBuilder]: At program point L3173(line 3173) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,872 INFO L895 garLoopResultBuilder]: At program point L3173-2(lines 3172 3174) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-20 11:25:23,872 INFO L902 garLoopResultBuilder]: At program point L3140-1(lines 3123 3144) the Hoare annotation is: true [2022-11-20 11:25:23,872 INFO L899 garLoopResultBuilder]: For program point L3201-1(line 3201) no Hoare annotation was computed. [2022-11-20 11:25:23,872 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataEXIT(lines 3200 3202) no Hoare annotation was computed. [2022-11-20 11:25:23,873 INFO L895 garLoopResultBuilder]: At program point L3201(line 3201) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-11-20 11:25:23,873 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataFINAL(lines 3200 3202) no Hoare annotation was computed. [2022-11-20 11:25:23,873 INFO L895 garLoopResultBuilder]: At program point rdev_get_drvdataENTRY(lines 3200 3202) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-11-20 11:25:23,873 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 2172 2178) the Hoare annotation is: true [2022-11-20 11:25:23,874 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 2172 2178) no Hoare annotation was computed. [2022-11-20 11:25:23,874 INFO L902 garLoopResultBuilder]: At program point L2694(lines 2691 2696) the Hoare annotation is: true [2022-11-20 11:25:23,874 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 2172 2178) no Hoare annotation was computed. [2022-11-20 11:25:23,878 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:23,881 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:25:23,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:25:23 BoogieIcfgContainer [2022-11-20 11:25:23,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:25:23,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:25:23,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:25:23,910 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:25:23,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:01" (3/4) ... [2022-11-20 11:25:23,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:25:23,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2022-11-20 11:25:23,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-11-20 11:25:23,923 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 11:25:23,923 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-20 11:25:23,923 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2022-11-20 11:25:23,923 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2022-11-20 11:25:23,924 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-11-20 11:25:23,924 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2022-11-20 11:25:23,924 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2022-11-20 11:25:23,924 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-20 11:25:23,938 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2022-11-20 11:25:23,940 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-20 11:25:23,941 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 11:25:23,942 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 11:25:23,944 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:25:24,120 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:25:24,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:25:24,121 INFO L158 Benchmark]: Toolchain (without parser) took 25909.71ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 155.3MB in the beginning and 302.7MB in the end (delta: -147.4MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,122 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 130.0MB. Free memory was 97.8MB in the beginning and 97.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:25:24,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1174.60ms. Allocated memory is still 188.7MB. Free memory was 154.3MB in the beginning and 111.0MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.46ms. Allocated memory is still 188.7MB. Free memory was 111.0MB in the beginning and 104.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,123 INFO L158 Benchmark]: Boogie Preprocessor took 90.27ms. Allocated memory is still 188.7MB. Free memory was 104.7MB in the beginning and 99.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,123 INFO L158 Benchmark]: RCFGBuilder took 1463.77ms. Allocated memory is still 188.7MB. Free memory was 99.5MB in the beginning and 115.0MB in the end (delta: -15.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,124 INFO L158 Benchmark]: TraceAbstraction took 22870.32ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 114.0MB in the beginning and 316.4MB in the end (delta: -202.4MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,124 INFO L158 Benchmark]: Witness Printer took 211.24ms. Allocated memory is still 394.3MB. Free memory was 316.4MB in the beginning and 302.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:25:24,126 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.34ms. Allocated memory is still 130.0MB. Free memory was 97.8MB in the beginning and 97.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1174.60ms. Allocated memory is still 188.7MB. Free memory was 154.3MB in the beginning and 111.0MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.46ms. Allocated memory is still 188.7MB. Free memory was 111.0MB in the beginning and 104.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.27ms. Allocated memory is still 188.7MB. Free memory was 104.7MB in the beginning and 99.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1463.77ms. Allocated memory is still 188.7MB. Free memory was 99.5MB in the beginning and 115.0MB in the end (delta: -15.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22870.32ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 114.0MB in the beginning and 316.4MB in the end (delta: -202.4MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. * Witness Printer took 211.24ms. Allocated memory is still 394.3MB. Free memory was 316.4MB in the beginning and 302.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: 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 11 procedures, 192 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3939 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3760 mSDsluCounter, 9861 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5447 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1712 IncrementalHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 4414 mSDtfsCounter, 1712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1231occurred in iteration=10, InterpolantAutomatonStates: 75, 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, 15 MinimizatonAttempts, 2722 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 1214 PreInvPairs, 1340 NumberOfFragments, 1446 HoareAnnotationTreeSize, 1214 FomulaSimplifications, 4879 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 76 FomulaSimplificationsInter, 8870 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 2809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5390 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 720/765 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 10 specifications checked. All of them hold - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((1 <= i && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: (((i <= 2 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 0 <= i) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: (((1 <= i && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3211]: Loop Invariant Derived loop invariant: ((((1 <= i && i <= 2) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || (((i == 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3145]: Loop Invariant Derived loop invariant: (ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2691]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && i == 0) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((((1 <= i && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: (ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2245]: Loop Invariant Derived loop invariant: (ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((i + 1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2659]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: (((1 <= i && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || (((i == 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3113]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 3175]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2441]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3172]: Loop Invariant Derived loop invariant: (ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: (((i <= 2 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 0 <= i) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2651]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2222]: Loop Invariant Derived loop invariant: ((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2252]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2166]: Loop Invariant Derived loop invariant: ((((1 <= i && i <= 2) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || (((i == 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3165]: Loop Invariant Derived loop invariant: ((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3169]: Loop Invariant Derived loop invariant: ((1 <= i && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2229]: Loop Invariant Derived loop invariant: ((1 <= i && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 3179]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && i == 0) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((((i <= 2 && 1 <= i) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 2269]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3187]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((((1 <= i && i <= 2) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || (((i == 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3208]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2378]: Loop Invariant Derived loop invariant: (((1 <= i && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2667]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3183]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2675]: Loop Invariant Derived loop invariant: ((((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || ((ldv_state_variable_1 == 1 && ref_cnt == 0) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 11:25:24,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3bdbc6e-137f-4138-adc9-730f294f5836/bin/uautomizer-ug76WZFUDN/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