./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:40:06,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:40:06,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:40:06,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:40:06,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:40:06,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:40:06,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:40:06,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:40:06,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:40:06,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:40:06,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:40:06,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:40:06,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:40:06,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:40:06,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:40:06,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:40:06,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:40:06,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:40:06,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:40:06,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:40:06,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:40:06,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:40:06,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:40:06,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:40:06,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:40:06,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:40:06,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:40:06,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:40:06,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:40:06,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:40:06,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:40:06,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:40:06,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:40:06,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:40:06,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:40:06,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:40:06,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:40:06,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:40:06,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:40:06,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:40:06,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:40:06,658 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 17:40:06,697 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:40:06,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:40:06,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:40:06,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:40:06,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:40:06,704 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:40:06,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:40:06,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:40:06,705 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:40:06,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:40:06,724 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:40:06,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:40:06,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:40:06,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:40:06,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:40:06,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:40:06,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:40:06,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:40:06,727 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:40:06,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:40:06,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:40:06,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:40:06,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:40:06,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:40:06,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:40:06,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:40:06,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:40:06,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:40:06,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:40:06,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:40:06,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:40:06,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:40:06,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:40:06,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:40:06,732 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:40:06,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:40:06,733 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2022-11-25 17:40:07,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:40:07,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:40:07,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:40:07,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:40:07,066 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:40:07,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/bitvector/byte_add_2-1.i [2022-11-25 17:40:10,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:40:10,456 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:40:10,457 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/sv-benchmarks/c/bitvector/byte_add_2-1.i [2022-11-25 17:40:10,464 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/data/f10c51585/17bf87905c1a4c938839378e8e02dd4c/FLAG4b05e3a14 [2022-11-25 17:40:10,482 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/data/f10c51585/17bf87905c1a4c938839378e8e02dd4c [2022-11-25 17:40:10,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:40:10,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:40:10,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:40:10,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:40:10,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:40:10,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c5a3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10, skipping insertion in model container [2022-11-25 17:40:10,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:40:10,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:40:10,737 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_430231d5-9b77-4c51-a5d2-eb1c2c585a63/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2022-11-25 17:40:10,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:40:10,792 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:40:10,805 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_430231d5-9b77-4c51-a5d2-eb1c2c585a63/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2022-11-25 17:40:10,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:40:10,858 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:40:10,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10 WrapperNode [2022-11-25 17:40:10,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:40:10,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:40:10,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:40:10,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:40:10,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,909 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-11-25 17:40:10,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:40:10,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:40:10,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:40:10,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:40:10,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:40:10,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:40:10,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:40:10,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:40:10,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (1/1) ... [2022-11-25 17:40:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:40:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:11,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:40:11,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:40:11,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:40:11,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:40:11,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:40:11,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:40:11,163 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:40:11,166 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:40:11,665 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:40:11,673 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:40:11,673 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:40:11,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:40:11 BoogieIcfgContainer [2022-11-25 17:40:11,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:40:11,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:40:11,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:40:11,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:40:11,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:40:10" (1/3) ... [2022-11-25 17:40:11,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d89bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:40:11, skipping insertion in model container [2022-11-25 17:40:11,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:40:10" (2/3) ... [2022-11-25 17:40:11,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d89bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:40:11, skipping insertion in model container [2022-11-25 17:40:11,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:40:11" (3/3) ... [2022-11-25 17:40:11,685 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2022-11-25 17:40:11,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:40:11,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-25 17:40:11,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:40:11,774 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;@64a17975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:40:11,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-25 17:40:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 17:40:11,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:11,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 17:40:11,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-11-25 17:40:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:11,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295420346] [2022-11-25 17:40:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295420346] [2022-11-25 17:40:12,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295420346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:12,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:12,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:40:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704495316] [2022-11-25 17:40:12,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:12,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:40:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:40:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:40:12,093 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:12,134 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2022-11-25 17:40:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:40:12,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-25 17:40:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:12,187 INFO L225 Difference]: With dead ends: 153 [2022-11-25 17:40:12,187 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 17:40:12,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:40:12,200 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:12,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:40:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 17:40:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-25 17:40:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-11-25 17:40:12,281 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2022-11-25 17:40:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:12,282 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-11-25 17:40:12,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-11-25 17:40:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:40:12,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:12,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:12,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:40:12,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2022-11-25 17:40:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:12,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215450221] [2022-11-25 17:40:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:12,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215450221] [2022-11-25 17:40:12,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215450221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:12,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:40:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092340057] [2022-11-25 17:40:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:12,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:40:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:12,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:40:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:40:12,566 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:12,759 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2022-11-25 17:40:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:40:12,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-11-25 17:40:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:12,761 INFO L225 Difference]: With dead ends: 162 [2022-11-25 17:40:12,761 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 17:40:12,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:40:12,763 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:12,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 139 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:40:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 17:40:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2022-11-25 17:40:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-11-25 17:40:12,776 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2022-11-25 17:40:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:12,776 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-11-25 17:40:12,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-11-25 17:40:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:40:12,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:12,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:12,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:40:12,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2022-11-25 17:40:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:12,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431639889] [2022-11-25 17:40:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:40:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:12,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431639889] [2022-11-25 17:40:12,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431639889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:12,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:12,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:40:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105353156] [2022-11-25 17:40:12,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:12,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:40:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:40:12,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:40:12,988 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:13,289 INFO L93 Difference]: Finished difference Result 251 states and 338 transitions. [2022-11-25 17:40:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:40:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2022-11-25 17:40:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:13,298 INFO L225 Difference]: With dead ends: 251 [2022-11-25 17:40:13,299 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 17:40:13,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:40:13,307 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 136 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:13,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 326 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:40:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 17:40:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 114. [2022-11-25 17:40:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2022-11-25 17:40:13,339 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 24 [2022-11-25 17:40:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:13,342 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2022-11-25 17:40:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2022-11-25 17:40:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 17:40:13,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:13,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:13,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:40:13,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1448694967, now seen corresponding path program 1 times [2022-11-25 17:40:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:13,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104109285] [2022-11-25 17:40:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:40:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:13,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104109285] [2022-11-25 17:40:13,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104109285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:13,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:13,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:40:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668518169] [2022-11-25 17:40:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:13,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:40:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:40:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:40:13,525 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:13,533 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2022-11-25 17:40:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:40:13,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-11-25 17:40:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:13,535 INFO L225 Difference]: With dead ends: 182 [2022-11-25 17:40:13,535 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 17:40:13,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:40:13,537 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 89 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:13,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:40:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 17:40:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-25 17:40:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2022-11-25 17:40:13,546 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 27 [2022-11-25 17:40:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:13,546 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2022-11-25 17:40:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-11-25 17:40:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 17:40:13,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:13,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:13,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:40:13,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1250590583, now seen corresponding path program 1 times [2022-11-25 17:40:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:13,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775461006] [2022-11-25 17:40:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:13,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775461006] [2022-11-25 17:40:13,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775461006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:13,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:13,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:40:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956557783] [2022-11-25 17:40:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:13,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:40:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:40:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:40:13,807 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:14,018 INFO L93 Difference]: Finished difference Result 242 states and 322 transitions. [2022-11-25 17:40:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:40:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2022-11-25 17:40:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:14,020 INFO L225 Difference]: With dead ends: 242 [2022-11-25 17:40:14,021 INFO L226 Difference]: Without dead ends: 173 [2022-11-25 17:40:14,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:40:14,026 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 133 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:14,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 304 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:40:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-25 17:40:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 96. [2022-11-25 17:40:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2022-11-25 17:40:14,043 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 33 [2022-11-25 17:40:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:14,044 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2022-11-25 17:40:14,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2022-11-25 17:40:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:40:14,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:14,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:14,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:40:14,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1993043557, now seen corresponding path program 1 times [2022-11-25 17:40:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:14,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105651398] [2022-11-25 17:40:14,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:14,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105651398] [2022-11-25 17:40:14,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105651398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:14,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168033992] [2022-11-25 17:40:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:14,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:14,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:14,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:40:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:14,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:40:14,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:14,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:40:14,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168033992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:14,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:40:14,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 17:40:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143594195] [2022-11-25 17:40:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:40:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:40:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:40:14,421 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:14,657 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2022-11-25 17:40:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:40:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-25 17:40:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:14,659 INFO L225 Difference]: With dead ends: 205 [2022-11-25 17:40:14,659 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 17:40:14,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:40:14,660 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:14,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 164 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:40:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 17:40:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2022-11-25 17:40:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2022-11-25 17:40:14,670 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 36 [2022-11-25 17:40:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:14,670 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2022-11-25 17:40:14,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-11-25 17:40:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 17:40:14,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:14,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:14,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:14,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:14,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1280522041, now seen corresponding path program 1 times [2022-11-25 17:40:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:14,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050155918] [2022-11-25 17:40:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050155918] [2022-11-25 17:40:15,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050155918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906534184] [2022-11-25 17:40:15,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:15,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:15,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:15,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:40:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:15,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:40:15,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:40:15,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:40:15,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906534184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:15,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:40:15,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-25 17:40:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750553651] [2022-11-25 17:40:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:15,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:40:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:40:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:40:15,478 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:15,563 INFO L93 Difference]: Finished difference Result 244 states and 321 transitions. [2022-11-25 17:40:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:40:15,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2022-11-25 17:40:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:15,565 INFO L225 Difference]: With dead ends: 244 [2022-11-25 17:40:15,565 INFO L226 Difference]: Without dead ends: 127 [2022-11-25 17:40:15,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:40:15,567 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:15,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 136 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:40:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-25 17:40:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2022-11-25 17:40:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2022-11-25 17:40:15,585 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 43 [2022-11-25 17:40:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:15,585 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2022-11-25 17:40:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2022-11-25 17:40:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 17:40:15,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:15,587 INFO L195 NwaCegarLoop]: trace histogram [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-25 17:40:15,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:15,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 17:40:15,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -493197952, now seen corresponding path program 1 times [2022-11-25 17:40:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114684363] [2022-11-25 17:40:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:16,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114684363] [2022-11-25 17:40:16,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114684363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:16,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569019446] [2022-11-25 17:40:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:16,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:16,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:40:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:16,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:40:16,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:40:16,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:40:16,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569019446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:16,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:40:16,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-25 17:40:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966215619] [2022-11-25 17:40:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:16,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:40:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:40:16,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:40:16,353 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:16,513 INFO L93 Difference]: Finished difference Result 273 states and 369 transitions. [2022-11-25 17:40:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:40:16,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 52 [2022-11-25 17:40:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:16,515 INFO L225 Difference]: With dead ends: 273 [2022-11-25 17:40:16,516 INFO L226 Difference]: Without dead ends: 164 [2022-11-25 17:40:16,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:40:16,517 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:16,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 199 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:40:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-25 17:40:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2022-11-25 17:40:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2022-11-25 17:40:16,530 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 52 [2022-11-25 17:40:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:16,530 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2022-11-25 17:40:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2022-11-25 17:40:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 17:40:16,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:16,533 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-25 17:40:16,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:16,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:16,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -271705697, now seen corresponding path program 1 times [2022-11-25 17:40:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390556293] [2022-11-25 17:40:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:40:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390556293] [2022-11-25 17:40:17,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390556293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980256525] [2022-11-25 17:40:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:17,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:17,042 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:17,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:40:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:17,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:40:17,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 17:40:17,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:40:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980256525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:17,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:40:17,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-11-25 17:40:17,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392238635] [2022-11-25 17:40:17,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:17,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:40:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:17,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:40:17,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:40:17,256 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:17,397 INFO L93 Difference]: Finished difference Result 318 states and 421 transitions. [2022-11-25 17:40:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:40:17,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 68 [2022-11-25 17:40:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:17,401 INFO L225 Difference]: With dead ends: 318 [2022-11-25 17:40:17,402 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 17:40:17,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:40:17,404 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:17,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 200 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:40:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 17:40:17,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 161. [2022-11-25 17:40:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2022-11-25 17:40:17,413 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 68 [2022-11-25 17:40:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:17,413 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2022-11-25 17:40:17,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2022-11-25 17:40:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-25 17:40:17,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:17,416 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:17,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:17,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:17,622 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1991578566, now seen corresponding path program 1 times [2022-11-25 17:40:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:17,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697948636] [2022-11-25 17:40:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-25 17:40:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:17,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697948636] [2022-11-25 17:40:17,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697948636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:17,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:17,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:40:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243309560] [2022-11-25 17:40:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:17,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:40:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:40:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:40:17,911 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:18,196 INFO L93 Difference]: Finished difference Result 629 states and 780 transitions. [2022-11-25 17:40:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:40:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 84 [2022-11-25 17:40:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:18,199 INFO L225 Difference]: With dead ends: 629 [2022-11-25 17:40:18,199 INFO L226 Difference]: Without dead ends: 490 [2022-11-25 17:40:18,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:40:18,200 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 245 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:18,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 506 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:40:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-25 17:40:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 161. [2022-11-25 17:40:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2022-11-25 17:40:18,211 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 84 [2022-11-25 17:40:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:18,211 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2022-11-25 17:40:18,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2022-11-25 17:40:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 17:40:18,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:18,213 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:18,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:40:18,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1230056049, now seen corresponding path program 1 times [2022-11-25 17:40:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267788126] [2022-11-25 17:40:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-25 17:40:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:18,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267788126] [2022-11-25 17:40:18,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267788126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:18,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:18,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:40:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506772250] [2022-11-25 17:40:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:18,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:40:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:40:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:40:18,464 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:18,917 INFO L93 Difference]: Finished difference Result 796 states and 985 transitions. [2022-11-25 17:40:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:40:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 87 [2022-11-25 17:40:18,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:18,921 INFO L225 Difference]: With dead ends: 796 [2022-11-25 17:40:18,921 INFO L226 Difference]: Without dead ends: 657 [2022-11-25 17:40:18,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:40:18,922 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 368 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:18,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 665 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:40:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-11-25 17:40:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 161. [2022-11-25 17:40:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2022-11-25 17:40:18,937 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 87 [2022-11-25 17:40:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:18,938 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2022-11-25 17:40:18,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2022-11-25 17:40:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 17:40:18,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:18,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:18,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:40:18,940 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1677424560, now seen corresponding path program 1 times [2022-11-25 17:40:18,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:18,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291920610] [2022-11-25 17:40:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:18,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-25 17:40:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:19,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291920610] [2022-11-25 17:40:19,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291920610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:19,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351453227] [2022-11-25 17:40:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:19,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:19,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:40:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:19,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 17:40:19,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:40:19,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:40:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 17:40:19,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351453227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:40:19,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:40:19,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2022-11-25 17:40:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108664621] [2022-11-25 17:40:19,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:40:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:40:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:40:19,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:40:19,617 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:20,513 INFO L93 Difference]: Finished difference Result 840 states and 1136 transitions. [2022-11-25 17:40:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:40:20,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 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 87 [2022-11-25 17:40:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:20,516 INFO L225 Difference]: With dead ends: 840 [2022-11-25 17:40:20,517 INFO L226 Difference]: Without dead ends: 682 [2022-11-25 17:40:20,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:40:20,518 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 524 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:20,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 498 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:40:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-11-25 17:40:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 560. [2022-11-25 17:40:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.302325581395349) internal successors, (728), 559 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 728 transitions. [2022-11-25 17:40:20,555 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 728 transitions. Word has length 87 [2022-11-25 17:40:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:20,555 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 728 transitions. [2022-11-25 17:40:20,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 728 transitions. [2022-11-25 17:40:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 17:40:20,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:20,557 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:20,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:20,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 17:40:20,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1511267789, now seen corresponding path program 1 times [2022-11-25 17:40:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:20,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551056562] [2022-11-25 17:40:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-25 17:40:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551056562] [2022-11-25 17:40:21,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551056562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:21,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:21,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:40:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585528558] [2022-11-25 17:40:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:21,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:40:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:40:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:40:21,017 INFO L87 Difference]: Start difference. First operand 560 states and 728 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:21,618 INFO L93 Difference]: Finished difference Result 1545 states and 2010 transitions. [2022-11-25 17:40:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:40:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 89 [2022-11-25 17:40:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:21,623 INFO L225 Difference]: With dead ends: 1545 [2022-11-25 17:40:21,624 INFO L226 Difference]: Without dead ends: 1196 [2022-11-25 17:40:21,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:40:21,625 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 489 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:21,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 992 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:40:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-11-25 17:40:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 555. [2022-11-25 17:40:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.3032490974729243) internal successors, (722), 554 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 722 transitions. [2022-11-25 17:40:21,662 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 722 transitions. Word has length 89 [2022-11-25 17:40:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:21,664 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 722 transitions. [2022-11-25 17:40:21,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 722 transitions. [2022-11-25 17:40:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 17:40:21,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:21,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:40:21,666 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -967413213, now seen corresponding path program 1 times [2022-11-25 17:40:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145199082] [2022-11-25 17:40:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-25 17:40:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:21,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145199082] [2022-11-25 17:40:21,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145199082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:21,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255260573] [2022-11-25 17:40:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:21,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:21,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:22,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:40:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:22,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:40:22,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:40:22,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:40:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 17:40:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255260573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:40:22,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:40:22,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-11-25 17:40:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788973786] [2022-11-25 17:40:22,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:40:22,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:40:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:40:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:40:22,948 INFO L87 Difference]: Start difference. First operand 555 states and 722 transitions. Second operand has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:32,349 INFO L93 Difference]: Finished difference Result 7473 states and 9268 transitions. [2022-11-25 17:40:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-11-25 17:40:32,349 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 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 93 [2022-11-25 17:40:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:32,370 INFO L225 Difference]: With dead ends: 7473 [2022-11-25 17:40:32,371 INFO L226 Difference]: Without dead ends: 6769 [2022-11-25 17:40:32,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8153 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2871, Invalid=19479, Unknown=0, NotChecked=0, Total=22350 [2022-11-25 17:40:32,379 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 2287 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 4513 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 4513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:32,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 3295 Invalid, 4646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 4513 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 17:40:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2022-11-25 17:40:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 889. [2022-11-25 17:40:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.3344594594594594) internal successors, (1185), 888 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1185 transitions. [2022-11-25 17:40:32,508 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1185 transitions. Word has length 93 [2022-11-25 17:40:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:32,508 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1185 transitions. [2022-11-25 17:40:32,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1185 transitions. [2022-11-25 17:40:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 17:40:32,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:32,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2022-11-25 17:40:32,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:32,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:32,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1116141497, now seen corresponding path program 1 times [2022-11-25 17:40:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:32,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351936451] [2022-11-25 17:40:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 17:40:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351936451] [2022-11-25 17:40:32,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351936451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852412935] [2022-11-25 17:40:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:32,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:40:32,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:40:32,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:40:32,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:40:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:32,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:40:32,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:40:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 17:40:33,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:40:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 17:40:33,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852412935] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 17:40:33,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:40:33,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-11-25 17:40:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855774697] [2022-11-25 17:40:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:33,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:40:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:40:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:40:33,287 INFO L87 Difference]: Start difference. First operand 889 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:33,577 INFO L93 Difference]: Finished difference Result 2432 states and 3298 transitions. [2022-11-25 17:40:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:40:33,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 101 [2022-11-25 17:40:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:33,584 INFO L225 Difference]: With dead ends: 2432 [2022-11-25 17:40:33,584 INFO L226 Difference]: Without dead ends: 1793 [2022-11-25 17:40:33,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:40:33,586 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 146 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:33,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 224 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:40:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2022-11-25 17:40:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1547. [2022-11-25 17:40:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 1.3551099611901682) internal successors, (2095), 1546 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2095 transitions. [2022-11-25 17:40:33,756 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2095 transitions. Word has length 101 [2022-11-25 17:40:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:33,756 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2095 transitions. [2022-11-25 17:40:33,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2095 transitions. [2022-11-25 17:40:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-25 17:40:33,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:33,762 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:40:33,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:40:33,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:40:33,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1501915936, now seen corresponding path program 1 times [2022-11-25 17:40:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:33,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870288310] [2022-11-25 17:40:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:40:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 17:40:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:40:34,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870288310] [2022-11-25 17:40:34,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870288310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:40:34,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:40:34,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:40:34,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19933098] [2022-11-25 17:40:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:40:34,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:40:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:40:34,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:40:34,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:40:34,194 INFO L87 Difference]: Start difference. First operand 1547 states and 2095 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:40:34,703 INFO L93 Difference]: Finished difference Result 3250 states and 4371 transitions. [2022-11-25 17:40:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:40:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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 102 [2022-11-25 17:40:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:40:34,710 INFO L225 Difference]: With dead ends: 3250 [2022-11-25 17:40:34,710 INFO L226 Difference]: Without dead ends: 1939 [2022-11-25 17:40:34,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:40:34,713 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 246 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:40:34,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 356 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:40:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-11-25 17:40:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1493. [2022-11-25 17:40:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.329088471849866) internal successors, (1983), 1492 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1983 transitions. [2022-11-25 17:40:34,850 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1983 transitions. Word has length 102 [2022-11-25 17:40:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:40:34,851 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1983 transitions. [2022-11-25 17:40:34,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:40:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1983 transitions. [2022-11-25 17:40:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 17:40:34,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:40:34,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:34,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:40:34,855 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-25 17:40:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:40:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash -702020810, now seen corresponding path program 1 times [2022-11-25 17:40:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:40:34,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826261994] [2022-11-25 17:40:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:40:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:40:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:40:34,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:40:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:40:35,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:40:35,003 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:40:35,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2022-11-25 17:40:35,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2022-11-25 17:40:35,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2022-11-25 17:40:35,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2022-11-25 17:40:35,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2022-11-25 17:40:35,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2022-11-25 17:40:35,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2022-11-25 17:40:35,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2022-11-25 17:40:35,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2022-11-25 17:40:35,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2022-11-25 17:40:35,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2022-11-25 17:40:35,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2022-11-25 17:40:35,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2022-11-25 17:40:35,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2022-11-25 17:40:35,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2022-11-25 17:40:35,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2022-11-25 17:40:35,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2022-11-25 17:40:35,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2022-11-25 17:40:35,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2022-11-25 17:40:35,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2022-11-25 17:40:35,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2022-11-25 17:40:35,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2022-11-25 17:40:35,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2022-11-25 17:40:35,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2022-11-25 17:40:35,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2022-11-25 17:40:35,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2022-11-25 17:40:35,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2022-11-25 17:40:35,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2022-11-25 17:40:35,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2022-11-25 17:40:35,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2022-11-25 17:40:35,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2022-11-25 17:40:35,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2022-11-25 17:40:35,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2022-11-25 17:40:35,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2022-11-25 17:40:35,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2022-11-25 17:40:35,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2022-11-25 17:40:35,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2022-11-25 17:40:35,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2022-11-25 17:40:35,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2022-11-25 17:40:35,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2022-11-25 17:40:35,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2022-11-25 17:40:35,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:40:35,018 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:40:35,023 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:40:35,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:40:35 BoogieIcfgContainer [2022-11-25 17:40:35,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:40:35,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:40:35,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:40:35,102 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:40:35,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:40:11" (3/4) ... [2022-11-25 17:40:35,104 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:40:35,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:40:35,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:40:35,210 INFO L158 Benchmark]: Toolchain (without parser) took 24723.54ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 115.7MB in the beginning and 118.2MB in the end (delta: -2.5MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,211 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 157.3MB. Free memory was 125.6MB in the beginning and 125.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:40:35,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.40ms. Allocated memory is still 157.3MB. Free memory was 115.2MB in the beginning and 102.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.02ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 99.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,213 INFO L158 Benchmark]: Boogie Preprocessor took 47.64ms. Allocated memory is still 157.3MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,214 INFO L158 Benchmark]: RCFGBuilder took 716.23ms. Allocated memory is still 157.3MB. Free memory was 97.3MB in the beginning and 74.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,214 INFO L158 Benchmark]: TraceAbstraction took 23422.98ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 74.3MB in the beginning and 126.6MB in the end (delta: -52.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,215 INFO L158 Benchmark]: Witness Printer took 108.16ms. Allocated memory is still 255.9MB. Free memory was 126.6MB in the beginning and 118.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:40:35,219 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.32ms. Allocated memory is still 157.3MB. Free memory was 125.6MB in the beginning and 125.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.40ms. Allocated memory is still 157.3MB. Free memory was 115.2MB in the beginning and 102.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.02ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 99.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.64ms. Allocated memory is still 157.3MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 716.23ms. Allocated memory is still 157.3MB. Free memory was 97.3MB in the beginning and 74.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23422.98ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 74.3MB in the beginning and 126.6MB in the end (delta: -52.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Witness Printer took 108.16ms. Allocated memory is still 255.9MB. Free memory was 126.6MB in the beginning and 118.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=101, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L116] r1 << 8U VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L116] r2 << 16U VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] [L116] r3 << 24U VAL [\old(a)=4060086272, \old(b)=234770789, a=4060086272, a0=-234881024, a1=-917504, a2=-3584, a3=-14, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=101, r1=81, r2=254, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4910 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4910 mSDsluCounter, 8212 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6127 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7197 IncrementalHoareTripleChecker+Invalid, 7580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 2085 mSDtfsCounter, 7197 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 778 SyntacticMatches, 13 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8340 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1547occurred in iteration=15, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 8388 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 7404 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1078 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 1090/1299 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:40:35,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_430231d5-9b77-4c51-a5d2-eb1c2c585a63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)