./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 b5237d83 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_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/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_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a --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-b5237d8 [2022-11-21 16:07:44,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:07:44,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:07:44,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:07:44,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:07:44,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:07:44,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:07:44,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:07:44,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:07:44,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:07:44,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:07:44,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:07:44,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:07:44,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:07:44,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:07:44,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:07:44,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:07:44,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:07:44,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:07:44,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:07:44,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:07:44,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:07:44,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:07:44,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:07:44,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:07:44,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:07:44,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:07:44,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:07:44,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:07:44,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:07:44,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:07:44,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:07:44,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:07:44,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:07:44,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:07:44,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:07:44,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:07:44,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:07:44,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:07:44,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:07:44,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:07:44,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 16:07:44,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:07:44,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:07:44,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:07:44,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:07:44,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:07:44,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:07:44,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:07:44,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:07:44,509 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:07:44,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:07:44,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:07:44,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:07:44,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:07:44,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:07:44,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:07:44,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:07:44,512 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 16:07:44,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:07:44,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:07:44,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:07:44,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:07:44,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:07:44,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:07:44,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:07:44,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:07:44,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:07:44,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:07:44,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:07:44,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:07:44,515 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:07:44,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:07:44,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:07:44,516 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_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/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_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a 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-21 16:07:44,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:07:44,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:07:44,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:07:44,833 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:07:44,833 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:07:44,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-11-21 16:07:47,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:07:48,308 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:07:48,308 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-11-21 16:07:48,341 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/data/ea3dc632c/d42bb8857fa5423795b79a305eb7beec/FLAG3727f544d [2022-11-21 16:07:48,359 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/data/ea3dc632c/d42bb8857fa5423795b79a305eb7beec [2022-11-21 16:07:48,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:07:48,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:07:48,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:07:48,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:07:48,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:07:48,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:07:48" (1/1) ... [2022-11-21 16:07:48,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc53e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:48, skipping insertion in model container [2022-11-21 16:07:48,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:07:48" (1/1) ... [2022-11-21 16:07:48,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:07:48,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:07:49,012 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_64b94d43-9805-4dc9-ae42-6418e05b85a2/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-21 16:07:49,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:07:49,133 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:07:49,292 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_64b94d43-9805-4dc9-ae42-6418e05b85a2/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-21 16:07:49,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:07:49,439 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:07:49,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49 WrapperNode [2022-11-21 16:07:49,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:07:49,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:07:49,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:07:49,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:07:49,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,574 INFO L138 Inliner]: procedures = 99, calls = 345, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 750 [2022-11-21 16:07:49,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:07:49,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:07:49,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:07:49,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:07:49,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,674 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:07:49,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:07:49,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:07:49,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:07:49,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (1/1) ... [2022-11-21 16:07:49,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:07:49,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:07:49,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:07:49,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:07:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2022-11-21 16:07:49,778 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2022-11-21 16:07:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:07:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:07:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:07:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-21 16:07:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-21 16:07:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-21 16:07:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-21 16:07:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2022-11-21 16:07:49,780 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2022-11-21 16:07:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:07:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-11-21 16:07:49,780 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-11-21 16:07:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:07:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:07:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:07:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:07:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2022-11-21 16:07:49,781 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2022-11-21 16:07:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:07:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-11-21 16:07:49,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-11-21 16:07:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:07:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:07:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-11-21 16:07:49,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-11-21 16:07:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:07:49,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:07:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-21 16:07:49,783 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-21 16:07:50,060 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:07:50,065 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:07:50,823 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:07:50,836 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:07:50,838 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:07:50,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:07:50 BoogieIcfgContainer [2022-11-21 16:07:50,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:07:50,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:07:50,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:07:50,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:07:50,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:07:48" (1/3) ... [2022-11-21 16:07:50,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284f4bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:07:50, skipping insertion in model container [2022-11-21 16:07:50,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:07:49" (2/3) ... [2022-11-21 16:07:50,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284f4bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:07:50, skipping insertion in model container [2022-11-21 16:07:50,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:07:50" (3/3) ... [2022-11-21 16:07:50,854 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-11-21 16:07:50,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:07:50,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-21 16:07:50,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:07:50,945 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;@452b8224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:07:50,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-21 16:07:50,954 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-21 16:07:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:07:50,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:50,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:50,969 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-21 16:07:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1444456607, now seen corresponding path program 1 times [2022-11-21 16:07:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248479676] [2022-11-21 16:07:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:51,464 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-21 16:07:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248479676] [2022-11-21 16:07:51,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248479676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:51,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:51,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:51,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279588980] [2022-11-21 16:07:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:51,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:07:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:51,504 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-21 16:07:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:51,763 INFO L93 Difference]: Finished difference Result 497 states and 696 transitions. [2022-11-21 16:07:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:51,765 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-21 16:07:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:51,783 INFO L225 Difference]: With dead ends: 497 [2022-11-21 16:07:51,784 INFO L226 Difference]: Without dead ends: 272 [2022-11-21 16:07:51,792 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-21 16:07:51,798 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 16:07:51,800 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-21 16:07:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-21 16:07:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-21 16:07:51,889 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-21 16:07:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2022-11-21 16:07:51,901 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 15 [2022-11-21 16:07:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:51,902 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2022-11-21 16:07:51,902 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-21 16:07:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2022-11-21 16:07:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:07:51,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:51,909 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-21 16:07:51,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:07:51,910 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-21 16:07:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2072638708, now seen corresponding path program 1 times [2022-11-21 16:07:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:51,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908797631] [2022-11-21 16:07:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:52,229 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-21 16:07:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:52,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908797631] [2022-11-21 16:07:52,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908797631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:52,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:52,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:07:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136222150] [2022-11-21 16:07:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:52,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:07:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:52,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:07:52,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:07:52,244 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-21 16:07:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:52,332 INFO L93 Difference]: Finished difference Result 541 states and 715 transitions. [2022-11-21 16:07:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:07:52,333 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-21 16:07:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:52,336 INFO L225 Difference]: With dead ends: 541 [2022-11-21 16:07:52,336 INFO L226 Difference]: Without dead ends: 537 [2022-11-21 16:07:52,337 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-21 16:07:52,338 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 16:07:52,339 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-21 16:07:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-21 16:07:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2022-11-21 16:07:52,377 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-21 16:07:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 711 transitions. [2022-11-21 16:07:52,386 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 711 transitions. Word has length 26 [2022-11-21 16:07:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:52,386 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 711 transitions. [2022-11-21 16:07:52,386 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-21 16:07:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 711 transitions. [2022-11-21 16:07:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:07:52,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:52,392 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-21 16:07:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:07:52,393 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-21 16:07:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash -482153609, now seen corresponding path program 1 times [2022-11-21 16:07:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83566090] [2022-11-21 16:07:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:07:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-21 16:07:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:52,571 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-21 16:07:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83566090] [2022-11-21 16:07:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83566090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:52,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:52,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:07:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918628878] [2022-11-21 16:07:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:52,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:07:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:52,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:07:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:07:52,578 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-21 16:07:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:53,176 INFO L93 Difference]: Finished difference Result 1179 states and 1583 transitions. [2022-11-21 16:07:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:07:53,177 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-21 16:07:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:53,182 INFO L225 Difference]: With dead ends: 1179 [2022-11-21 16:07:53,183 INFO L226 Difference]: Without dead ends: 651 [2022-11-21 16:07:53,185 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-21 16:07:53,186 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 204 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-21 16:07:53,186 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-21 16:07:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-11-21 16:07:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 626. [2022-11-21 16:07:53,232 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-21 16:07:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 834 transitions. [2022-11-21 16:07:53,236 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 834 transitions. Word has length 36 [2022-11-21 16:07:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:53,237 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 834 transitions. [2022-11-21 16:07:53,237 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-21 16:07:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 834 transitions. [2022-11-21 16:07:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 16:07:53,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:53,240 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:07:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:07:53,241 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-21 16:07:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 888153265, now seen corresponding path program 1 times [2022-11-21 16:07:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:53,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432690344] [2022-11-21 16:07:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:53,420 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-21 16:07:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:53,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432690344] [2022-11-21 16:07:53,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432690344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:53,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:53,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:07:53,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315563363] [2022-11-21 16:07:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:53,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:07:53,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:07:53,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:07:53,423 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-21 16:07:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:53,883 INFO L93 Difference]: Finished difference Result 1300 states and 1729 transitions. [2022-11-21 16:07:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:07:53,884 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-21 16:07:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:53,890 INFO L225 Difference]: With dead ends: 1300 [2022-11-21 16:07:53,890 INFO L226 Difference]: Without dead ends: 920 [2022-11-21 16:07:53,892 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-21 16:07:53,900 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-21 16:07:53,901 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-21 16:07:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-21 16:07:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 630. [2022-11-21 16:07:53,963 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-21 16:07:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 838 transitions. [2022-11-21 16:07:53,968 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 838 transitions. Word has length 39 [2022-11-21 16:07:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:53,968 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 838 transitions. [2022-11-21 16:07:53,968 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-21 16:07:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 838 transitions. [2022-11-21 16:07:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:07:53,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:53,973 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-21 16:07:53,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:07:53,974 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-21 16:07:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1659416553, now seen corresponding path program 1 times [2022-11-21 16:07:53,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:53,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199401048] [2022-11-21 16:07:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:07:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:07:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:07:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:54,240 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-21 16:07:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199401048] [2022-11-21 16:07:54,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199401048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:54,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:54,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960913287] [2022-11-21 16:07:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:54,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:07:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:54,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:07:54,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:07:54,254 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-21 16:07:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:54,758 INFO L93 Difference]: Finished difference Result 1212 states and 1624 transitions. [2022-11-21 16:07:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:07:54,759 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-21 16:07:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:54,763 INFO L225 Difference]: With dead ends: 1212 [2022-11-21 16:07:54,764 INFO L226 Difference]: Without dead ends: 685 [2022-11-21 16:07:54,765 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-21 16:07:54,766 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-21 16:07:54,766 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-21 16:07:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-21 16:07:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 660. [2022-11-21 16:07:54,812 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-21 16:07:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-11-21 16:07:54,816 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 51 [2022-11-21 16:07:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:54,816 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-11-21 16:07:54,817 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-21 16:07:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-11-21 16:07:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-21 16:07:54,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:54,818 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-21 16:07:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:07:54,819 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-21 16:07:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash -757179182, now seen corresponding path program 1 times [2022-11-21 16:07:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:54,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153773835] [2022-11-21 16:07:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:07:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:07:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:07:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 16:07:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:55,158 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-21 16:07:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153773835] [2022-11-21 16:07:55,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153773835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:55,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:55,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:07:55,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125669217] [2022-11-21 16:07:55,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:55,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:07:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:07:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:07:55,161 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-21 16:07:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:56,086 INFO L93 Difference]: Finished difference Result 1546 states and 2136 transitions. [2022-11-21 16:07:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:07:56,087 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-21 16:07:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:56,094 INFO L225 Difference]: With dead ends: 1546 [2022-11-21 16:07:56,094 INFO L226 Difference]: Without dead ends: 989 [2022-11-21 16:07:56,095 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-21 16:07:56,096 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 143 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:07:56,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1002 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:07:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-11-21 16:07:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 662. [2022-11-21 16:07:56,143 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-21 16:07:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 876 transitions. [2022-11-21 16:07:56,147 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 876 transitions. Word has length 61 [2022-11-21 16:07:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:56,148 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 876 transitions. [2022-11-21 16:07:56,149 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-21 16:07:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 876 transitions. [2022-11-21 16:07:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:07:56,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:56,152 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-21 16:07:56,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:07:56,152 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-21 16:07:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 550582253, now seen corresponding path program 1 times [2022-11-21 16:07:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224380196] [2022-11-21 16:07:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:07:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:07:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:56,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:07:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:56,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:07:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:07:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:56,461 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-21 16:07:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:56,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224380196] [2022-11-21 16:07:56,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224380196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:56,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:56,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:07:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216403639] [2022-11-21 16:07:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:56,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:07:56,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:56,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:07:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:07:56,465 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-21 16:07:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:57,081 INFO L93 Difference]: Finished difference Result 989 states and 1397 transitions. [2022-11-21 16:07:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:07:57,082 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-21 16:07:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:57,087 INFO L225 Difference]: With dead ends: 989 [2022-11-21 16:07:57,087 INFO L226 Difference]: Without dead ends: 987 [2022-11-21 16:07:57,088 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-21 16:07:57,089 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 151 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:07:57,089 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.6s Time] [2022-11-21 16:07:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-11-21 16:07:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 660. [2022-11-21 16:07:57,132 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-21 16:07:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 872 transitions. [2022-11-21 16:07:57,135 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 872 transitions. Word has length 71 [2022-11-21 16:07:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:57,136 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 872 transitions. [2022-11-21 16:07:57,136 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-21 16:07:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 872 transitions. [2022-11-21 16:07:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 16:07:57,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:57,138 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-21 16:07:57,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:07:57,139 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-21 16:07:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash -111819200, now seen corresponding path program 1 times [2022-11-21 16:07:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:57,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747575913] [2022-11-21 16:07:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:07:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:07:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:07:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:07:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:07:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,497 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-21 16:07:57,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:57,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747575913] [2022-11-21 16:07:57,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747575913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:07:57,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421730258] [2022-11-21 16:07:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:07:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:07:57,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:07:57,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:07:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:57,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:07:57,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:07:58,063 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-21 16:07:58,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:07:58,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421730258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:58,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:07:58,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-21 16:07:58,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10407575] [2022-11-21 16:07:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:58,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:07:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:07:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:07:58,096 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-21 16:07:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:58,552 INFO L93 Difference]: Finished difference Result 1523 states and 2092 transitions. [2022-11-21 16:07:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:07:58,552 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-21 16:07:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:58,557 INFO L225 Difference]: With dead ends: 1523 [2022-11-21 16:07:58,557 INFO L226 Difference]: Without dead ends: 966 [2022-11-21 16:07:58,559 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-21 16:07:58,560 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-21 16:07:58,560 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-21 16:07:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-11-21 16:07:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 660. [2022-11-21 16:07:58,614 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-21 16:07:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 868 transitions. [2022-11-21 16:07:58,618 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 868 transitions. Word has length 72 [2022-11-21 16:07:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:58,619 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 868 transitions. [2022-11-21 16:07:58,619 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-21 16:07:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 868 transitions. [2022-11-21 16:07:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 16:07:58,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:58,623 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-21 16:07:58,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:07:58,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:07:58,831 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-21 16:07:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1584626497, now seen corresponding path program 1 times [2022-11-21 16:07:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:58,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685873586] [2022-11-21 16:07:58,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:07:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:07:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:07:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:07:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,062 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-21 16:07:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:59,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685873586] [2022-11-21 16:07:59,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685873586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:07:59,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:07:59,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:07:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831199258] [2022-11-21 16:07:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:07:59,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:07:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:07:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:07:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:07:59,066 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-21 16:07:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:07:59,399 INFO L93 Difference]: Finished difference Result 1084 states and 1433 transitions. [2022-11-21 16:07:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:07:59,399 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-21 16:07:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:07:59,403 INFO L225 Difference]: With dead ends: 1084 [2022-11-21 16:07:59,403 INFO L226 Difference]: Without dead ends: 691 [2022-11-21 16:07:59,407 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-21 16:07:59,409 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-21 16:07:59,410 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-21 16:07:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-11-21 16:07:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 666. [2022-11-21 16:07:59,450 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-21 16:07:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 875 transitions. [2022-11-21 16:07:59,453 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 875 transitions. Word has length 77 [2022-11-21 16:07:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:07:59,453 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 875 transitions. [2022-11-21 16:07:59,453 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-21 16:07:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 875 transitions. [2022-11-21 16:07:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 16:07:59,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:07:59,461 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-21 16:07:59,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:07:59,462 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-21 16:07:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:07:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash -586388578, now seen corresponding path program 1 times [2022-11-21 16:07:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:07:59,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782645803] [2022-11-21 16:07:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:07:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:07:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:07:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:07:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:07:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:07:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:07:59,679 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-21 16:07:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:07:59,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782645803] [2022-11-21 16:07:59,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782645803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:07:59,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100611635] [2022-11-21 16:07:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:07:59,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:07:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:07:59,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:07:59,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:08:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:00,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:08:00,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:08:00,236 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-21 16:08:00,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:08:00,413 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-21 16:08:00,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100611635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:08:00,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:08:00,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-11-21 16:08:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216633409] [2022-11-21 16:08:00,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:08:00,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:08:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:08:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:08:00,424 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-21 16:08:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:01,458 INFO L93 Difference]: Finished difference Result 2096 states and 2783 transitions. [2022-11-21 16:08:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:08:01,459 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-21 16:08:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:01,466 INFO L225 Difference]: With dead ends: 2096 [2022-11-21 16:08:01,466 INFO L226 Difference]: Without dead ends: 1697 [2022-11-21 16:08:01,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:08:01,469 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 1341 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:01,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 994 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:08:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-11-21 16:08:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1231. [2022-11-21 16:08:01,591 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-21 16:08:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1621 transitions. [2022-11-21 16:08:01,596 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1621 transitions. Word has length 86 [2022-11-21 16:08:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:01,597 INFO L495 AbstractCegarLoop]: Abstraction has 1231 states and 1621 transitions. [2022-11-21 16:08:01,597 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-21 16:08:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1621 transitions. [2022-11-21 16:08:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-21 16:08:01,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:01,600 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-21 16:08:01,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:08:01,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 16:08:01,807 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-21 16:08:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash 753227037, now seen corresponding path program 1 times [2022-11-21 16:08:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533362159] [2022-11-21 16:08:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:08:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:08:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:08:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:08:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:08:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:08:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,044 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-21 16:08:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:02,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533362159] [2022-11-21 16:08:02,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533362159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:08:02,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363070037] [2022-11-21 16:08:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:02,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:08:02,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:08:02,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:08:02,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:08:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:02,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:08:02,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:08:02,493 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-21 16:08:02,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:08:02,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363070037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:02,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:08:02,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-21 16:08:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288277317] [2022-11-21 16:08:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:02,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:08:02,496 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-21 16:08:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:02,705 INFO L93 Difference]: Finished difference Result 1750 states and 2418 transitions. [2022-11-21 16:08:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:08:02,706 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-21 16:08:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:02,714 INFO L225 Difference]: With dead ends: 1750 [2022-11-21 16:08:02,714 INFO L226 Difference]: Without dead ends: 1749 [2022-11-21 16:08:02,715 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-21 16:08:02,715 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.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:02,716 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.0s Time] [2022-11-21 16:08:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2022-11-21 16:08:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1230. [2022-11-21 16:08:02,831 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-21 16:08:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1619 transitions. [2022-11-21 16:08:02,836 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1619 transitions. Word has length 91 [2022-11-21 16:08:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:02,836 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1619 transitions. [2022-11-21 16:08:02,837 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-21 16:08:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1619 transitions. [2022-11-21 16:08:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 16:08:02,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:02,839 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-21 16:08:02,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:08:03,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 16:08:03,046 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-21 16:08:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1673718044, now seen corresponding path program 1 times [2022-11-21 16:08:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:03,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943707334] [2022-11-21 16:08:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:08:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:08:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:08:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:08:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:08:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:08:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,285 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-21 16:08:03,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:03,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943707334] [2022-11-21 16:08:03,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943707334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:08:03,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643775333] [2022-11-21 16:08:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:08:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:08:03,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:08:03,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:08:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:03,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:08:03,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:08:03,912 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-21 16:08:03,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:08:03,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643775333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:03,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:08:03,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-21 16:08:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409425507] [2022-11-21 16:08:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:03,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:03,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:08:03,914 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-21 16:08:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:04,095 INFO L93 Difference]: Finished difference Result 1394 states and 1834 transitions. [2022-11-21 16:08:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:08:04,095 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-21 16:08:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:04,101 INFO L225 Difference]: With dead ends: 1394 [2022-11-21 16:08:04,101 INFO L226 Difference]: Without dead ends: 1392 [2022-11-21 16:08:04,102 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-21 16:08:04,102 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-21 16:08:04,103 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-21 16:08:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-11-21 16:08:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1064. [2022-11-21 16:08:04,183 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-21 16:08:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1402 transitions. [2022-11-21 16:08:04,187 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1402 transitions. Word has length 96 [2022-11-21 16:08:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:04,188 INFO L495 AbstractCegarLoop]: Abstraction has 1064 states and 1402 transitions. [2022-11-21 16:08:04,188 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-21 16:08:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1402 transitions. [2022-11-21 16:08:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:08:04,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:04,190 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-21 16:08:04,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:08:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:08:04,397 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-21 16:08:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1994966859, now seen corresponding path program 1 times [2022-11-21 16:08:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:04,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391523515] [2022-11-21 16:08:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:08:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:08:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:08:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:08:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:08:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:08:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:08:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:04,564 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-21 16:08:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:04,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391523515] [2022-11-21 16:08:04,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391523515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:04,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:04,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:08:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730283290] [2022-11-21 16:08:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:04,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:04,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:04,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:08:04,566 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-21 16:08:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:04,913 INFO L93 Difference]: Finished difference Result 1104 states and 1461 transitions. [2022-11-21 16:08:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:08:04,914 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-21 16:08:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:04,919 INFO L225 Difference]: With dead ends: 1104 [2022-11-21 16:08:04,919 INFO L226 Difference]: Without dead ends: 1103 [2022-11-21 16:08:04,919 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-21 16:08:04,920 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 26 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:04,920 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.2s Time] [2022-11-21 16:08:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-11-21 16:08:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1055. [2022-11-21 16:08:05,000 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-21 16:08:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1390 transitions. [2022-11-21 16:08:05,004 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1390 transitions. Word has length 99 [2022-11-21 16:08:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:05,005 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1390 transitions. [2022-11-21 16:08:05,005 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-21 16:08:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1390 transitions. [2022-11-21 16:08:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-21 16:08:05,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:05,009 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-21 16:08:05,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:08:05,010 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-21 16:08:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -134700621, now seen corresponding path program 1 times [2022-11-21 16:08:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:05,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989298060] [2022-11-21 16:08:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:08:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:08:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:08:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:08:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 16:08:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:08:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-21 16:08:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:08:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-21 16:08:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:05,265 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-21 16:08:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:05,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989298060] [2022-11-21 16:08:05,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989298060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:05,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:05,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:08:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100605269] [2022-11-21 16:08:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:05,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:08:05,268 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-21 16:08:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:05,923 INFO L93 Difference]: Finished difference Result 1837 states and 2422 transitions. [2022-11-21 16:08:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:08:05,924 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-21 16:08:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:05,928 INFO L225 Difference]: With dead ends: 1837 [2022-11-21 16:08:05,928 INFO L226 Difference]: Without dead ends: 885 [2022-11-21 16:08:05,930 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-21 16:08:05,931 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.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:05,931 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.6s Time] [2022-11-21 16:08:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-21 16:08:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 855. [2022-11-21 16:08:06,041 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-21 16:08:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1116 transitions. [2022-11-21 16:08:06,044 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1116 transitions. Word has length 148 [2022-11-21 16:08:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:06,045 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1116 transitions. [2022-11-21 16:08:06,045 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-21 16:08:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1116 transitions. [2022-11-21 16:08:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-21 16:08:06,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:08:06,049 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-21 16:08:06,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:08:06,049 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-21 16:08:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:08:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash -450540211, now seen corresponding path program 2 times [2022-11-21 16:08:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:08:06,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254400772] [2022-11-21 16:08:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:08:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:08:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:08:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:08:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:08:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:08:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-21 16:08:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:08:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 16:08:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-21 16:08:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:08:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:08:06,361 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-21 16:08:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:08:06,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254400772] [2022-11-21 16:08:06,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254400772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:08:06,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:08:06,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:08:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516067854] [2022-11-21 16:08:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:08:06,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:08:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:08:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:08:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:08:06,364 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-21 16:08:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:08:06,753 INFO L93 Difference]: Finished difference Result 1157 states and 1512 transitions. [2022-11-21 16:08:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:08:06,754 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-21 16:08:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:08:06,755 INFO L225 Difference]: With dead ends: 1157 [2022-11-21 16:08:06,755 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:08:06,758 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-21 16:08:06,758 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:08:06,759 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.3s Time] [2022-11-21 16:08:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:08:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:08:06,760 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-21 16:08:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:08:06,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2022-11-21 16:08:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:08:06,760 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:08:06,761 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-21 16:08:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:08:06,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:08:06,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-21 16:08:06,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-21 16:08:06,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-21 16:08:06,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-21 16:08:06,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-21 16:08:06,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-21 16:08:06,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-21 16:08:06,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-21 16:08:06,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-21 16:08:06,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-21 16:08:06,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:08:06,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:08:10,599 INFO L899 garLoopResultBuilder]: For program point L2945(lines 2945 2948) no Hoare annotation was computed. [2022-11-21 16:08:10,599 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicEXIT(lines 2942 2952) no Hoare annotation was computed. [2022-11-21 16:08:10,599 INFO L899 garLoopResultBuilder]: For program point L2947-1(lines 2945 2948) no Hoare annotation was computed. [2022-11-21 16:08:10,599 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_lock_mtx_of_isl_pmicENTRY(lines 2942 2952) the Hoare annotation is: true [2022-11-21 16:08:10,599 INFO L902 garLoopResultBuilder]: At program point L2947(line 2947) the Hoare annotation is: true [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicFINAL(lines 2942 2952) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_unlock_mtx_of_isl_pmicENTRY(lines 3000 3010) the Hoare annotation is: true [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point L3005-1(lines 3003 3006) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L902 garLoopResultBuilder]: At program point L3005(line 3005) the Hoare annotation is: true [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicEXIT(lines 3000 3010) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point L3003(lines 3003 3006) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicFINAL(lines 3000 3010) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearFINAL(lines 3204 3206) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearEXIT(lines 3204 3206) no Hoare annotation was computed. [2022-11-21 16:08:10,600 INFO L902 garLoopResultBuilder]: At program point regulator_list_voltage_linearENTRY(lines 3204 3206) the Hoare annotation is: true [2022-11-21 16:08:10,601 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 3197 3199) the Hoare annotation is: true [2022-11-21 16:08:10,601 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 3197 3199) no Hoare annotation was computed. [2022-11-21 16:08:10,601 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 3197 3199) no Hoare annotation was computed. [2022-11-21 16:08:10,601 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-21 16:08:10,602 INFO L902 garLoopResultBuilder]: At program point L3162(line 3162) the Hoare annotation is: true [2022-11-21 16:08:10,602 INFO L899 garLoopResultBuilder]: For program point L3160(line 3160) no Hoare annotation was computed. [2022-11-21 16:08:10,602 INFO L899 garLoopResultBuilder]: For program point L3162-1(line 3162) no Hoare annotation was computed. [2022-11-21 16:08:10,602 INFO L899 garLoopResultBuilder]: For program point L3156(line 3156) no Hoare annotation was computed. [2022-11-21 16:08:10,602 INFO L899 garLoopResultBuilder]: For program point L3155(lines 3155 3157) no Hoare annotation was computed. [2022-11-21 16:08:10,602 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 3158 3164) no Hoare annotation was computed. [2022-11-21 16:08:10,602 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 3158 3164) no Hoare annotation was computed. [2022-11-21 16:08:10,603 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2684 2689) no Hoare annotation was computed. [2022-11-21 16:08:10,603 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2684 2689) the Hoare annotation is: true [2022-11-21 16:08:10,603 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2684 2689) no Hoare annotation was computed. [2022-11-21 16:08:10,603 INFO L902 garLoopResultBuilder]: At program point regulator_unregisterENTRY(lines 3214 3216) the Hoare annotation is: true [2022-11-21 16:08:10,603 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterFINAL(lines 3214 3216) no Hoare annotation was computed. [2022-11-21 16:08:10,603 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterEXIT(lines 3214 3216) no Hoare annotation was computed. [2022-11-21 16:08:10,604 INFO L902 garLoopResultBuilder]: At program point mutex_lockENTRY(lines 3190 3192) the Hoare annotation is: true [2022-11-21 16:08:10,604 INFO L899 garLoopResultBuilder]: For program point mutex_lockFINAL(lines 3190 3192) no Hoare annotation was computed. [2022-11-21 16:08:10,604 INFO L899 garLoopResultBuilder]: For program point mutex_lockEXIT(lines 3190 3192) no Hoare annotation was computed. [2022-11-21 16:08:10,604 INFO L899 garLoopResultBuilder]: For program point L2529(lines 2529 2533) no Hoare annotation was computed. [2022-11-21 16:08:10,604 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-11-21 16:08:10,605 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-21 16:08:10,605 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-21 16:08:10,606 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-21 16:08:10,606 INFO L899 garLoopResultBuilder]: For program point L2480(line 2480) no Hoare annotation was computed. [2022-11-21 16:08:10,607 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-21 16:08:10,607 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-21 16:08:10,607 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-21 16:08:10,607 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-21 16:08:10,607 INFO L899 garLoopResultBuilder]: For program point L2563(line 2563) no Hoare annotation was computed. [2022-11-21 16:08:10,608 INFO L899 garLoopResultBuilder]: For program point L2464(lines 2464 2468) no Hoare annotation was computed. [2022-11-21 16:08:10,608 INFO L899 garLoopResultBuilder]: For program point L2530-1(line 2530) no Hoare annotation was computed. [2022-11-21 16:08:10,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:08:10,608 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-21 16:08:10,608 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-21 16:08:10,609 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-21 16:08:10,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-11-21 16:08:10,609 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-21 16:08:10,609 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-21 16:08:10,609 INFO L899 garLoopResultBuilder]: For program point L2564(lines 2564 2579) no Hoare annotation was computed. [2022-11-21 16:08:10,609 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-21 16:08:10,610 INFO L899 garLoopResultBuilder]: For program point L2366-1(line 2366) no Hoare annotation was computed. [2022-11-21 16:08:10,610 INFO L899 garLoopResultBuilder]: For program point L3126(lines 3126 3129) no Hoare annotation was computed. [2022-11-21 16:08:10,610 INFO L899 garLoopResultBuilder]: For program point L2581(line 2581) no Hoare annotation was computed. [2022-11-21 16:08:10,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-11-21 16:08:10,610 INFO L902 garLoopResultBuilder]: At program point L3176(lines 3175 3177) the Hoare annotation is: true [2022-11-21 16:08:10,610 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-21 16:08:10,611 INFO L899 garLoopResultBuilder]: For program point L2466(line 2466) no Hoare annotation was computed. [2022-11-21 16:08:10,611 INFO L899 garLoopResultBuilder]: For program point L2499(line 2499) no Hoare annotation was computed. [2022-11-21 16:08:10,611 INFO L899 garLoopResultBuilder]: For program point L2466-1(line 2466) no Hoare annotation was computed. [2022-11-21 16:08:10,611 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-21 16:08:10,611 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-21 16:08:10,612 INFO L899 garLoopResultBuilder]: For program point L2549(line 2549) no Hoare annotation was computed. [2022-11-21 16:08:10,612 INFO L899 garLoopResultBuilder]: For program point L2566(lines 2566 2576) no Hoare annotation was computed. [2022-11-21 16:08:10,612 INFO L899 garLoopResultBuilder]: For program point L2500(lines 2500 2515) no Hoare annotation was computed. [2022-11-21 16:08:10,612 INFO L899 garLoopResultBuilder]: For program point L2368(line 2368) no Hoare annotation was computed. [2022-11-21 16:08:10,612 INFO L902 garLoopResultBuilder]: At program point L3128(line 3128) the Hoare annotation is: true [2022-11-21 16:08:10,612 INFO L899 garLoopResultBuilder]: For program point L2550(lines 2550 2554) no Hoare annotation was computed. [2022-11-21 16:08:10,612 INFO L899 garLoopResultBuilder]: For program point L3128-1(lines 3125 3143) no Hoare annotation was computed. [2022-11-21 16:08:10,613 INFO L899 garLoopResultBuilder]: For program point L2517(line 2517) no Hoare annotation was computed. [2022-11-21 16:08:10,613 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-21 16:08:10,613 INFO L899 garLoopResultBuilder]: For program point L2567(line 2567) no Hoare annotation was computed. [2022-11-21 16:08:10,613 INFO L899 garLoopResultBuilder]: For program point L2369(lines 2369 2373) no Hoare annotation was computed. [2022-11-21 16:08:10,613 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-21 16:08:10,613 INFO L899 garLoopResultBuilder]: For program point L2353-1(line 2353) no Hoare annotation was computed. [2022-11-21 16:08:10,614 INFO L899 garLoopResultBuilder]: For program point L2353(line 2353) no Hoare annotation was computed. [2022-11-21 16:08:10,614 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-21 16:08:10,614 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-21 16:08:10,614 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-21 16:08:10,614 INFO L899 garLoopResultBuilder]: For program point L3212-1(line 3212) no Hoare annotation was computed. [2022-11-21 16:08:10,614 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2572) no Hoare annotation was computed. [2022-11-21 16:08:10,615 INFO L899 garLoopResultBuilder]: For program point L2502(lines 2502 2508) no Hoare annotation was computed. [2022-11-21 16:08:10,615 INFO L899 garLoopResultBuilder]: For program point L2535(line 2535) no Hoare annotation was computed. [2022-11-21 16:08:10,615 INFO L899 garLoopResultBuilder]: For program point L2502-2(lines 2500 2514) no Hoare annotation was computed. [2022-11-21 16:08:10,615 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-21 16:08:10,615 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:08:10,615 INFO L899 garLoopResultBuilder]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2022-11-21 16:08:10,616 INFO L899 garLoopResultBuilder]: For program point L2337-2(lines 2337 2341) no Hoare annotation was computed. [2022-11-21 16:08:10,616 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-21 16:08:10,616 INFO L899 garLoopResultBuilder]: For program point L2321(lines 2321 2324) no Hoare annotation was computed. [2022-11-21 16:08:10,616 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-21 16:08:10,616 INFO L899 garLoopResultBuilder]: For program point L2536(lines 2536 2540) no Hoare annotation was computed. [2022-11-21 16:08:10,616 INFO L899 garLoopResultBuilder]: For program point L2569-1(line 2569) no Hoare annotation was computed. [2022-11-21 16:08:10,617 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-21 16:08:10,617 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-11-21 16:08:10,617 INFO L899 garLoopResultBuilder]: For program point L2487(line 2487) no Hoare annotation was computed. [2022-11-21 16:08:10,617 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-21 16:08:10,617 INFO L899 garLoopResultBuilder]: For program point L2388-1(line 2388) no Hoare annotation was computed. [2022-11-21 16:08:10,617 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-11-21 16:08:10,618 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-21 16:08:10,618 INFO L902 garLoopResultBuilder]: At program point L3132(line 3132) the Hoare annotation is: true [2022-11-21 16:08:10,618 INFO L899 garLoopResultBuilder]: For program point L3132-1(lines 3125 3143) no Hoare annotation was computed. [2022-11-21 16:08:10,618 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2522) no Hoare annotation was computed. [2022-11-21 16:08:10,618 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-21 16:08:10,618 INFO L899 garLoopResultBuilder]: For program point L2389-1(line 2389) no Hoare annotation was computed. [2022-11-21 16:08:10,619 INFO L899 garLoopResultBuilder]: For program point L2389(line 2389) no Hoare annotation was computed. [2022-11-21 16:08:10,619 INFO L899 garLoopResultBuilder]: For program point L2257-1(line 2257) no Hoare annotation was computed. [2022-11-21 16:08:10,619 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-21 16:08:10,619 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-21 16:08:10,619 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-21 16:08:10,619 INFO L899 garLoopResultBuilder]: For program point L2472(line 2472) no Hoare annotation was computed. [2022-11-21 16:08:10,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-11-21 16:08:10,620 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-21 16:08:10,620 INFO L899 garLoopResultBuilder]: For program point L2274-1(line 2274) no Hoare annotation was computed. [2022-11-21 16:08:10,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-11-21 16:08:10,620 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-21 16:08:10,621 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-21 16:08:10,621 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-21 16:08:10,621 INFO L902 garLoopResultBuilder]: At program point L2588(lines 2441 2590) the Hoare annotation is: true [2022-11-21 16:08:10,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:08:10,621 INFO L899 garLoopResultBuilder]: For program point L3166-1(line 3166) no Hoare annotation was computed. [2022-11-21 16:08:10,621 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-21 16:08:10,622 INFO L899 garLoopResultBuilder]: For program point L2456(lines 2456 2583) no Hoare annotation was computed. [2022-11-21 16:08:10,622 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-21 16:08:10,622 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-21 16:08:10,622 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2478) no Hoare annotation was computed. [2022-11-21 16:08:10,622 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-21 16:08:10,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-11-21 16:08:10,623 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-21 16:08:10,623 INFO L899 garLoopResultBuilder]: For program point L2556(line 2556) no Hoare annotation was computed. [2022-11-21 16:08:10,623 INFO L899 garLoopResultBuilder]: For program point L2490(lines 2490 2519) no Hoare annotation was computed. [2022-11-21 16:08:10,623 INFO L899 garLoopResultBuilder]: For program point L2457(line 2457) no Hoare annotation was computed. [2022-11-21 16:08:10,623 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-21 16:08:10,624 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-21 16:08:10,624 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-21 16:08:10,624 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-21 16:08:10,624 INFO L899 garLoopResultBuilder]: For program point L2524(line 2524) no Hoare annotation was computed. [2022-11-21 16:08:10,624 INFO L899 garLoopResultBuilder]: For program point L2458(lines 2458 2485) no Hoare annotation was computed. [2022-11-21 16:08:10,624 INFO L899 garLoopResultBuilder]: For program point L2491(line 2491) no Hoare annotation was computed. [2022-11-21 16:08:10,625 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-21 16:08:10,625 INFO L902 garLoopResultBuilder]: At program point L2425(lines 2421 2427) the Hoare annotation is: true [2022-11-21 16:08:10,625 INFO L899 garLoopResultBuilder]: For program point L2574(line 2574) no Hoare annotation was computed. [2022-11-21 16:08:10,625 INFO L902 garLoopResultBuilder]: At program point L3136(line 3136) the Hoare annotation is: true [2022-11-21 16:08:10,625 INFO L899 garLoopResultBuilder]: For program point L3136-1(lines 3125 3143) no Hoare annotation was computed. [2022-11-21 16:08:10,625 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2497) no Hoare annotation was computed. [2022-11-21 16:08:10,626 INFO L899 garLoopResultBuilder]: For program point L2525(lines 2525 2561) no Hoare annotation was computed. [2022-11-21 16:08:10,626 INFO L899 garLoopResultBuilder]: For program point L2327(lines 2327 2330) no Hoare annotation was computed. [2022-11-21 16:08:10,626 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2264) no Hoare annotation was computed. [2022-11-21 16:08:10,626 INFO L899 garLoopResultBuilder]: For program point L2261-2(lines 2261 2264) no Hoare annotation was computed. [2022-11-21 16:08:10,626 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-21 16:08:10,626 INFO L899 garLoopResultBuilder]: For program point L2542(line 2542) no Hoare annotation was computed. [2022-11-21 16:08:10,626 INFO L899 garLoopResultBuilder]: For program point L2476(line 2476) no Hoare annotation was computed. [2022-11-21 16:08:10,627 INFO L899 garLoopResultBuilder]: For program point L2476-1(line 2476) no Hoare annotation was computed. [2022-11-21 16:08:10,627 INFO L899 garLoopResultBuilder]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2022-11-21 16:08:10,627 INFO L899 garLoopResultBuilder]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2022-11-21 16:08:10,627 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-21 16:08:10,627 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:08:10,627 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-11-21 16:08:10,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-11-21 16:08:10,628 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2482) no Hoare annotation was computed. [2022-11-21 16:08:10,628 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-21 16:08:10,628 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2022-11-21 16:08:10,628 INFO L899 garLoopResultBuilder]: For program point L2345-1(line 2345) no Hoare annotation was computed. [2022-11-21 16:08:10,629 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-21 16:08:10,629 INFO L899 garLoopResultBuilder]: For program point L2527(lines 2527 2558) no Hoare annotation was computed. [2022-11-21 16:08:10,629 INFO L899 garLoopResultBuilder]: For program point L2461(line 2461) no Hoare annotation was computed. [2022-11-21 16:08:10,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-11-21 16:08:10,629 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-21 16:08:10,629 INFO L902 garLoopResultBuilder]: At program point L2511(lines 2447 2589) the Hoare annotation is: true [2022-11-21 16:08:10,630 INFO L899 garLoopResultBuilder]: For program point L2346(lines 2346 2352) no Hoare annotation was computed. [2022-11-21 16:08:10,630 INFO L899 garLoopResultBuilder]: For program point L2528(line 2528) no Hoare annotation was computed. [2022-11-21 16:08:10,630 INFO L899 garLoopResultBuilder]: For program point L2462(lines 2462 2470) no Hoare annotation was computed. [2022-11-21 16:08:10,630 INFO L899 garLoopResultBuilder]: For program point L3173-1(line 3173) no Hoare annotation was computed. [2022-11-21 16:08:10,630 INFO L902 garLoopResultBuilder]: At program point L3140(line 3140) the Hoare annotation is: true [2022-11-21 16:08:10,630 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-21 16:08:10,631 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-21 16:08:10,631 INFO L902 garLoopResultBuilder]: At program point L3140-1(lines 3123 3144) the Hoare annotation is: true [2022-11-21 16:08:10,631 INFO L899 garLoopResultBuilder]: For program point L3201-1(line 3201) no Hoare annotation was computed. [2022-11-21 16:08:10,631 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataEXIT(lines 3200 3202) no Hoare annotation was computed. [2022-11-21 16:08:10,631 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-21 16:08:10,632 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataFINAL(lines 3200 3202) no Hoare annotation was computed. [2022-11-21 16:08:10,632 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-21 16:08:10,632 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 2172 2178) the Hoare annotation is: true [2022-11-21 16:08:10,632 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 2172 2178) no Hoare annotation was computed. [2022-11-21 16:08:10,632 INFO L902 garLoopResultBuilder]: At program point L2694(lines 2691 2696) the Hoare annotation is: true [2022-11-21 16:08:10,632 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 2172 2178) no Hoare annotation was computed. [2022-11-21 16:08:10,636 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:08:10,638 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:08:10,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:08:10 BoogieIcfgContainer [2022-11-21 16:08:10,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:08:10,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:08:10,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:08:10,661 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:08:10,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:07:50" (3/4) ... [2022-11-21 16:08:10,665 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:08:10,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2022-11-21 16:08:10,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-11-21 16:08:10,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-21 16:08:10,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-21 16:08:10,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2022-11-21 16:08:10,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2022-11-21 16:08:10,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-11-21 16:08:10,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2022-11-21 16:08:10,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2022-11-21 16:08:10,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-21 16:08:10,685 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2022-11-21 16:08:10,696 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-21 16:08:10,697 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-21 16:08:10,698 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 16:08:10,699 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:08:10,845 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:08:10,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:08:10,846 INFO L158 Benchmark]: Toolchain (without parser) took 22482.82ms. Allocated memory was 155.2MB in the beginning and 417.3MB in the end (delta: 262.1MB). Free memory was 118.8MB in the beginning and 244.1MB in the end (delta: -125.4MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,846 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:08:10,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1074.42ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 142.1MB in the end (delta: -23.4MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.94ms. Allocated memory is still 188.7MB. Free memory was 142.1MB in the beginning and 135.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,848 INFO L158 Benchmark]: Boogie Preprocessor took 119.46ms. Allocated memory is still 188.7MB. Free memory was 135.8MB in the beginning and 130.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,849 INFO L158 Benchmark]: RCFGBuilder took 1145.16ms. Allocated memory is still 188.7MB. Free memory was 130.4MB in the beginning and 129.1MB in the end (delta: 1.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,849 INFO L158 Benchmark]: TraceAbstraction took 19815.67ms. Allocated memory was 188.7MB in the beginning and 417.3MB in the end (delta: 228.6MB). Free memory was 129.1MB in the beginning and 257.7MB in the end (delta: -128.6MB). Peak memory consumption was 239.8MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,849 INFO L158 Benchmark]: Witness Printer took 185.02ms. Allocated memory is still 417.3MB. Free memory was 257.7MB in the beginning and 244.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 16:08:10,852 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.24ms. Allocated memory is still 155.2MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1074.42ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 142.1MB in the end (delta: -23.4MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.94ms. Allocated memory is still 188.7MB. Free memory was 142.1MB in the beginning and 135.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.46ms. Allocated memory is still 188.7MB. Free memory was 135.8MB in the beginning and 130.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1145.16ms. Allocated memory is still 188.7MB. Free memory was 130.4MB in the beginning and 129.1MB in the end (delta: 1.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19815.67ms. Allocated memory was 188.7MB in the beginning and 417.3MB in the end (delta: 228.6MB). Free memory was 129.1MB in the beginning and 257.7MB in the end (delta: -128.6MB). Peak memory consumption was 239.8MB. Max. memory is 16.1GB. * Witness Printer took 185.02ms. Allocated memory is still 417.3MB. Free memory was 257.7MB in the beginning and 244.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 19.7s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3939 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3760 mSDsluCounter, 9861 SdHoareTripleChecker+Invalid, 5.1s 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.3s 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.0s 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.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.7s 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-21 16:08:10,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b94d43-9805-4dc9-ae42-6418e05b85a2/bin/uautomizer-vX5HgA9Q3a/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