./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:38:01,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:38:01,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:38:01,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:38:01,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:38:01,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:38:01,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:38:01,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:38:01,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:38:01,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:38:01,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:38:01,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:38:01,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:38:01,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:38:01,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:38:01,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:38:01,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:38:01,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:38:01,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:38:01,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:38:02,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:38:02,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:38:02,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:38:02,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:38:02,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:38:02,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:38:02,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:38:02,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:38:02,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:38:02,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:38:02,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:38:02,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:38:02,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:38:02,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:38:02,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:38:02,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:38:02,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:38:02,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:38:02,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:38:02,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:38:02,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:38:02,040 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:38:02,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:38:02,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:38:02,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:38:02,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:38:02,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:38:02,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:38:02,102 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:38:02,102 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:38:02,102 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:38:02,102 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:38:02,104 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:38:02,104 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:38:02,104 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:38:02,105 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:38:02,105 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:38:02,105 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:38:02,105 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:38:02,106 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:38:02,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:38:02,107 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:38:02,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:38:02,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:38:02,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:38:02,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:38:02,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:38:02,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:38:02,109 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:38:02,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:38:02,109 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:38:02,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:38:02,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:38:02,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:38:02,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:38:02,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:38:02,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:38:02,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:38:02,112 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:38:02,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:38:02,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:38:02,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:38:02,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:38:02,114 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/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_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf [2021-11-25 18:38:02,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:38:02,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:38:02,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:38:02,492 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:38:02,492 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:38:02,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2021-11-25 18:38:02,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/data/f651afc66/6c6ab03759c44631a6d8608b120a39fb/FLAGaa73a68f3 [2021-11-25 18:38:03,148 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:38:03,149 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2021-11-25 18:38:03,160 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/data/f651afc66/6c6ab03759c44631a6d8608b120a39fb/FLAGaa73a68f3 [2021-11-25 18:38:03,537 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/data/f651afc66/6c6ab03759c44631a6d8608b120a39fb [2021-11-25 18:38:03,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:38:03,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:38:03,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:38:03,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:38:03,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:38:03,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:03,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f97f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03, skipping insertion in model container [2021-11-25 18:38:03,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:03,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:38:03,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:38:03,821 WARN L230 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_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2021-11-25 18:38:03,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:38:03,863 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:38:03,890 WARN L230 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_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2021-11-25 18:38:03,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:38:03,927 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:38:03,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03 WrapperNode [2021-11-25 18:38:03,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:38:03,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:38:03,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:38:03,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:38:03,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:03,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:03,974 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2021-11-25 18:38:03,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:38:03,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:38:03,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:38:03,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:38:03,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:03,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:38:04,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:38:04,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:38:04,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:38:04,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (1/1) ... [2021-11-25 18:38:04,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:38:04,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:04,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:38:04,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:38:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:38:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-25 18:38:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-25 18:38:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:38:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:38:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:38:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-25 18:38:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-25 18:38:04,198 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:38:04,200 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:38:04,370 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:38:04,399 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:38:04,399 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 18:38:04,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:38:04 BoogieIcfgContainer [2021-11-25 18:38:04,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:38:04,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:38:04,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:38:04,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:38:04,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:38:03" (1/3) ... [2021-11-25 18:38:04,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2616087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:38:04, skipping insertion in model container [2021-11-25 18:38:04,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:03" (2/3) ... [2021-11-25 18:38:04,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2616087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:38:04, skipping insertion in model container [2021-11-25 18:38:04,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:38:04" (3/3) ... [2021-11-25 18:38:04,413 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound100.c [2021-11-25 18:38:04,421 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:38:04,421 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 18:38:04,485 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:38:04,492 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:38:04,493 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 18:38:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:38:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:38:04,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:04,518 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:04,519 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1046920148, now seen corresponding path program 1 times [2021-11-25 18:38:04,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577929018] [2021-11-25 18:38:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:04,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:04,650 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:04,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580658627] [2021-11-25 18:38:04,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:04,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:04,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:04,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:04,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:38:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:04,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-25 18:38:04,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:04,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:38:04,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:04,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577929018] [2021-11-25 18:38:04,866 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:04,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580658627] [2021-11-25 18:38:04,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580658627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:38:04,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:38:04,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:38:04,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510220296] [2021-11-25 18:38:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:38:04,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:38:04,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:04,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:38:04,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:38:04,929 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:38:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:05,007 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-11-25 18:38:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:38:05,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-25 18:38:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:05,019 INFO L225 Difference]: With dead ends: 32 [2021-11-25 18:38:05,020 INFO L226 Difference]: Without dead ends: 17 [2021-11-25 18:38:05,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:38:05,038 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:05,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:38:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-25 18:38:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-25 18:38:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:38:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-25 18:38:05,079 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-11-25 18:38:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:05,081 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-25 18:38:05,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:38:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-25 18:38:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 18:38:05,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:05,084 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:05,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:05,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-11-25 18:38:05,305 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:05,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1317434454, now seen corresponding path program 1 times [2021-11-25 18:38:05,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:05,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371514900] [2021-11-25 18:38:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:05,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:05,323 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:05,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429183160] [2021-11-25 18:38:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:05,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:05,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:05,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:38:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:05,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:38:05,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:05,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:38:05,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:05,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371514900] [2021-11-25 18:38:05,547 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:05,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429183160] [2021-11-25 18:38:05,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429183160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:38:05,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:38:05,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:38:05,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199155738] [2021-11-25 18:38:05,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:38:05,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:38:05,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:05,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:38:05,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:38:05,552 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:38:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:05,591 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-25 18:38:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:38:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2021-11-25 18:38:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:05,593 INFO L225 Difference]: With dead ends: 26 [2021-11-25 18:38:05,593 INFO L226 Difference]: Without dead ends: 19 [2021-11-25 18:38:05,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:38:05,596 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:05,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:38:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-25 18:38:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-25 18:38:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:38:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-11-25 18:38:05,606 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2021-11-25 18:38:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:05,606 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-11-25 18:38:05,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:38:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-11-25 18:38:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 18:38:05,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:05,608 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:05,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:05,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:05,833 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1319221914, now seen corresponding path program 1 times [2021-11-25 18:38:05,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:05,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684275234] [2021-11-25 18:38:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:05,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:05,844 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475738023] [2021-11-25 18:38:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:05,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:05,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:05,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:05,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:38:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:05,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:38:05,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:06,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:38:06,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:06,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684275234] [2021-11-25 18:38:06,227 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475738023] [2021-11-25 18:38:06,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475738023] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:38:06,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:38:06,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:38:06,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748492323] [2021-11-25 18:38:06,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:38:06,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:38:06,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:06,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:38:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:38:06,235 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:38:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:06,400 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-25 18:38:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:38:06,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2021-11-25 18:38:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:06,403 INFO L225 Difference]: With dead ends: 28 [2021-11-25 18:38:06,404 INFO L226 Difference]: Without dead ends: 26 [2021-11-25 18:38:06,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:38:06,406 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:06,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-25 18:38:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-25 18:38:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:38:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-11-25 18:38:06,417 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2021-11-25 18:38:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:06,417 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-25 18:38:06,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-25 18:38:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-11-25 18:38:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:38:06,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:06,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:06,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-25 18:38:06,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:06,650 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1562521278, now seen corresponding path program 1 times [2021-11-25 18:38:06,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:06,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372105663] [2021-11-25 18:38:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:06,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:06,664 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:06,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682752860] [2021-11-25 18:38:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:06,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:06,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:06,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:38:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:06,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:38:06,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:07,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:07,294 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:07,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372105663] [2021-11-25 18:38:07,294 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:07,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682752860] [2021-11-25 18:38:07,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682752860] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:07,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1365008178] [2021-11-25 18:38:07,322 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:38:07,322 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:38:07,337 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:38:07,344 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:38:07,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:38:08,156 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 142 for LOIs [2021-11-25 18:38:08,530 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:38:08,621 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:38:14,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1365008178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:38:14,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:38:14,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8] total 21 [2021-11-25 18:38:14,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445306352] [2021-11-25 18:38:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:38:14,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:38:14,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:38:14,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:38:14,774 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:38:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:14,906 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-11-25 18:38:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:38:14,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2021-11-25 18:38:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:14,908 INFO L225 Difference]: With dead ends: 32 [2021-11-25 18:38:14,909 INFO L226 Difference]: Without dead ends: 25 [2021-11-25 18:38:14,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:38:14,911 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:14,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2021-11-25 18:38:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-25 18:38:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-11-25 18:38:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:38:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-11-25 18:38:14,921 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2021-11-25 18:38:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:14,922 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-11-25 18:38:14,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:38:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-11-25 18:38:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:38:14,924 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:14,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:14,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:15,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:15,141 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -182192907, now seen corresponding path program 1 times [2021-11-25 18:38:15,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543236127] [2021-11-25 18:38:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:15,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:15,154 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:15,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885872940] [2021-11-25 18:38:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:15,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:15,157 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:15,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:38:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:15,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:38:15,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:15,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:15,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543236127] [2021-11-25 18:38:15,391 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885872940] [2021-11-25 18:38:15,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885872940] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:15,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [48378153] [2021-11-25 18:38:15,396 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:38:15,396 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:38:15,397 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:38:15,397 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:38:15,397 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:38:16,718 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 76 for LOIs [2021-11-25 18:38:16,964 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:38:17,019 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:38:18,589 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '702#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-25 18:38:18,589 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:38:18,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:38:18,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-11-25 18:38:18,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314015358] [2021-11-25 18:38:18,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:18,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:38:18,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:18,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:38:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-11-25 18:38:18,594 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-25 18:38:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:18,711 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-11-25 18:38:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:38:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2021-11-25 18:38:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:18,713 INFO L225 Difference]: With dead ends: 56 [2021-11-25 18:38:18,714 INFO L226 Difference]: Without dead ends: 49 [2021-11-25 18:38:18,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:38:18,716 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:18,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-25 18:38:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-11-25 18:38:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-25 18:38:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-11-25 18:38:18,729 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2021-11-25 18:38:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:18,730 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-11-25 18:38:18,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-25 18:38:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-11-25 18:38:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:38:18,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:18,732 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:18,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:18,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:18,945 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash -180405447, now seen corresponding path program 1 times [2021-11-25 18:38:18,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:18,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376970863] [2021-11-25 18:38:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:18,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:18,967 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921594822] [2021-11-25 18:38:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:18,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:18,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:18,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:18,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:38:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:19,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 18:38:19,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:29,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:33,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:33,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376970863] [2021-11-25 18:38:33,506 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:33,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921594822] [2021-11-25 18:38:33,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921594822] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:33,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [594715444] [2021-11-25 18:38:33,509 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-25 18:38:33,510 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:38:33,510 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:38:33,510 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:38:33,510 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:38:34,404 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 52 for LOIs [2021-11-25 18:38:34,663 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:38:34,721 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:38:39,249 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '999#(and (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_43| Int)) (and (<= |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_43| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_43| 2147483648)) (= |__VERIFIER_assert_#in~cond| (ite (= (+ (* 2 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_27|) (* |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_27|)) (+ (* 4 |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_43|) (* 4 |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_25|) (* |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_27|) (* 2 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_27|))) 1 0)) (or (and (= |#NULL.offset| 0) (= |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_27| 1) (= ~counter~0 2) (= |#NULL.base| 0)) (and (= |#NULL.offset| 0) (= |#NULL.base| 0))) (<= 0 (+ 4294967295 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_27|)) (<= 1 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_27|))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-25 18:38:39,250 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:38:39,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:38:39,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-11-25 18:38:39,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106082567] [2021-11-25 18:38:39,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:39,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:38:39,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:38:39,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:38:39,252 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-25 18:38:41,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-25 18:38:43,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-25 18:38:45,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-25 18:38:47,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-25 18:38:49,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-25 18:38:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:49,108 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2021-11-25 18:38:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:38:49,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2021-11-25 18:38:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:49,110 INFO L225 Difference]: With dead ends: 59 [2021-11-25 18:38:49,110 INFO L226 Difference]: Without dead ends: 51 [2021-11-25 18:38:49,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:38:49,112 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:49,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2021-11-25 18:38:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-25 18:38:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-11-25 18:38:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-25 18:38:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-11-25 18:38:49,122 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2021-11-25 18:38:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:49,122 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-11-25 18:38:49,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-25 18:38:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-11-25 18:38:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:38:49,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:49,124 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:49,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:38:49,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-25 18:38:49,331 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash 408559265, now seen corresponding path program 1 times [2021-11-25 18:38:49,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:49,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069226051] [2021-11-25 18:38:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:49,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:49,348 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:49,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715085593] [2021-11-25 18:38:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:49,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:49,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:49,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:49,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:38:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:38:49,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:38:49,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:49,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:38:49,604 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069226051] [2021-11-25 18:38:49,604 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715085593] [2021-11-25 18:38:49,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715085593] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [15557845] [2021-11-25 18:38:49,607 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:38:49,607 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:38:49,608 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:38:49,608 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:38:49,608 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:38:50,475 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 87 for LOIs [2021-11-25 18:38:51,037 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:38:51,084 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:38:54,335 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1332#(and (exists ((|v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_37| Int)) (and (<= 1 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_37|) (<= 0 (+ 4294967295 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_37|)) (<= 0 (+ |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_59| 2147483648)) (= |__VERIFIER_assert_#in~cond| (ite (= (+ (* 2 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_37|) (* 4 |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_34|) (* |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_37| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_37|) (* 4 |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_59|)) (+ (* 2 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_37|) (* |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_37| |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_37|))) 1 0)) (<= |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_59| 2147483647) (or (and (= |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_37| 1) (= |#NULL.offset| 0) (= ~counter~0 1) (= |#NULL.base| 0)) (and (= |#NULL.offset| 0) (= |#NULL.base| 0))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-25 18:38:54,335 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:38:54,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:38:54,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-11-25 18:38:54,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661741281] [2021-11-25 18:38:54,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:54,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:38:54,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:38:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:38:54,337 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-25 18:38:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:38:54,448 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-11-25 18:38:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:38:54,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2021-11-25 18:38:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:38:54,450 INFO L225 Difference]: With dead ends: 50 [2021-11-25 18:38:54,450 INFO L226 Difference]: Without dead ends: 45 [2021-11-25 18:38:54,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:38:54,451 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:38:54,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:38:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-25 18:38:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-25 18:38:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-25 18:38:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-11-25 18:38:54,460 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 28 [2021-11-25 18:38:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:38:54,461 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-11-25 18:38:54,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-25 18:38:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-11-25 18:38:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-25 18:38:54,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:38:54,463 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:38:54,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-25 18:38:54,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 18:38:54,669 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:38:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:38:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -235004718, now seen corresponding path program 2 times [2021-11-25 18:38:54,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:38:54,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841709199] [2021-11-25 18:38:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:38:54,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:38:54,678 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:38:54,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143341723] [2021-11-25 18:38:54,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:38:54,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:54,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:54,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:38:55,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 18:38:55,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:55,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 18:38:55,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:38:55,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-25 18:38:56,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:38:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841709199] [2021-11-25 18:38:56,060 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:38:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143341723] [2021-11-25 18:38:56,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143341723] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1662257907] [2021-11-25 18:38:56,062 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:38:56,062 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:38:56,063 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:38:56,063 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:38:56,063 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:38:56,946 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 79 for LOIs [2021-11-25 18:38:57,385 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:38:57,424 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:38:59,825 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1767#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_73| Int) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_45| Int)) (and (<= |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_73| 2147483647) (<= 0 (+ 4294967295 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_45|)) (or (and (= |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_45| 1) (= |#NULL.offset| 0) (= ~counter~0 2) (= |#NULL.base| 0)) (and (= |#NULL.offset| 0) (= |#NULL.base| 0))) (= (ite (= (+ (* 2 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_45|) (* |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_45|)) (+ (* 2 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_45|) (* 4 |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_73|) (* 4 |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_41|) (* |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_45|))) 1 0) |__VERIFIER_assert_#in~cond|) (<= 1 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_45|) (<= 0 (+ |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_73| 2147483648)))))' at error location [2021-11-25 18:38:59,825 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:38:59,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:38:59,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-11-25 18:38:59,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846608174] [2021-11-25 18:38:59,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:59,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:38:59,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:38:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:38:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:38:59,828 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-11-25 18:39:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:00,086 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-11-25 18:39:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 18:39:00,088 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 46 [2021-11-25 18:39:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:00,090 INFO L225 Difference]: With dead ends: 98 [2021-11-25 18:39:00,090 INFO L226 Difference]: Without dead ends: 93 [2021-11-25 18:39:00,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2021-11-25 18:39:00,092 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 91 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:00,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 81 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:39:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-25 18:39:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-25 18:39:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-25 18:39:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-11-25 18:39:00,120 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 46 [2021-11-25 18:39:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:00,120 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-11-25 18:39:00,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-11-25 18:39:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-11-25 18:39:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-25 18:39:00,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:00,131 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:00,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:00,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:00,337 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:39:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1419782260, now seen corresponding path program 3 times [2021-11-25 18:39:00,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:00,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123753639] [2021-11-25 18:39:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:00,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:00,348 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:39:00,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500253160] [2021-11-25 18:39:00,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:39:00,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:00,350 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:00,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:39:00,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:39:00,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:39:00,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 18:39:00,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:39:01,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-11-25 18:39:01,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123753639] [2021-11-25 18:39:01,485 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:39:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500253160] [2021-11-25 18:39:01,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500253160] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:01,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [47424354] [2021-11-25 18:39:01,488 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:39:01,488 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:39:01,488 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:39:01,489 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:39:01,489 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:39:02,184 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 76 for LOIs [2021-11-25 18:39:02,326 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:39:02,363 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:39:05,648 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2647#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-25 18:39:05,649 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:39:05,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:39:05,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-11-25 18:39:05,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718730432] [2021-11-25 18:39:05,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:05,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 18:39:05,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 18:39:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 18:39:05,653 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-11-25 18:39:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:06,207 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2021-11-25 18:39:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 18:39:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 94 [2021-11-25 18:39:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:06,210 INFO L225 Difference]: With dead ends: 194 [2021-11-25 18:39:06,210 INFO L226 Difference]: Without dead ends: 189 [2021-11-25 18:39:06,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=950, Invalid=2710, Unknown=0, NotChecked=0, Total=3660 [2021-11-25 18:39:06,214 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 193 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:06,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 151 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:39:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-25 18:39:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-11-25 18:39:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0071428571428571) internal successors, (141), 140 states have internal predecessors, (141), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-25 18:39:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2021-11-25 18:39:06,237 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 94 [2021-11-25 18:39:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:06,238 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2021-11-25 18:39:06,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-11-25 18:39:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2021-11-25 18:39:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-25 18:39:06,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:06,242 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:06,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:06,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:06,450 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:39:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1763378944, now seen corresponding path program 4 times [2021-11-25 18:39:06,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:06,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381591773] [2021-11-25 18:39:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:06,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:06,475 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:39:06,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488445521] [2021-11-25 18:39:06,476 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:39:06,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:06,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:06,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:06,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:39:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:06,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-25 18:39:06,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:39:07,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2021-11-25 18:39:08,151 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:39:08,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381591773] [2021-11-25 18:39:08,152 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:39:08,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488445521] [2021-11-25 18:39:08,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488445521] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:08,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598994930] [2021-11-25 18:39:08,163 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:39:08,163 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:39:08,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:39:08,164 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:39:08,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:39:08,951 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 76 for LOIs [2021-11-25 18:39:09,312 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:39:09,356 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:39:14,474 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4416#(and (exists ((|v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_103| Int) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_57| Int) (|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_63| Int)) (and (<= |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_103| 2147483647) (<= 1 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_63|) (<= 0 (+ 4294967295 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_63|)) (= (ite (= (+ (* 4 |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_57|) (* 2 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_63|) (* |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_63| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_63|) (* 4 |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_103|)) (+ (* 2 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_63|) (* |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_63| |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_63|))) 1 0) |__VERIFIER_assert_#in~cond|) (<= 0 (+ |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_103| 2147483648)) (or (and (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (= |#NULL.offset| 0) (= |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_63| 1) (= ~counter~0 2) (= |#NULL.base| 0))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-25 18:39:14,474 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:39:14,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:39:14,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-11-25 18:39:14,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451147159] [2021-11-25 18:39:14,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:14,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-25 18:39:14,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:39:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-25 18:39:14,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=2503, Unknown=0, NotChecked=0, Total=3906 [2021-11-25 18:39:14,479 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2021-11-25 18:39:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:16,476 INFO L93 Difference]: Finished difference Result 386 states and 410 transitions. [2021-11-25 18:39:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-25 18:39:16,477 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 190 [2021-11-25 18:39:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:16,482 INFO L225 Difference]: With dead ends: 386 [2021-11-25 18:39:16,482 INFO L226 Difference]: Without dead ends: 381 [2021-11-25 18:39:16,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 506 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2866 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=3586, Invalid=7970, Unknown=0, NotChecked=0, Total=11556 [2021-11-25 18:39:16,488 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 450 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:16,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 271 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:39:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-25 18:39:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-11-25 18:39:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 284 states have (on average 1.0035211267605635) internal successors, (285), 284 states have internal predecessors, (285), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-11-25 18:39:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2021-11-25 18:39:16,526 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 190 [2021-11-25 18:39:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:16,527 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2021-11-25 18:39:16,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2021-11-25 18:39:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2021-11-25 18:39:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2021-11-25 18:39:16,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:16,536 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:16,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:16,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 18:39:16,753 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:39:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1767238632, now seen corresponding path program 5 times [2021-11-25 18:39:16,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:39:16,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892044013] [2021-11-25 18:39:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:16,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:39:16,774 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:39:16,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861901331] [2021-11-25 18:39:16,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:39:16,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:16,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:16,776 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:16,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:42:17,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2021-11-25 18:42:17,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:42:17,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-25 18:42:17,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:42:18,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2021-11-25 18:42:21,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:42:21,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892044013] [2021-11-25 18:42:21,803 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:42:21,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861901331] [2021-11-25 18:42:21,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861901331] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:42:21,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1144418880] [2021-11-25 18:42:21,804 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:42:21,805 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:42:21,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:42:21,805 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:42:21,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:42:22,468 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 76 for LOIs [2021-11-25 18:42:22,629 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:42:22,663 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:42:24,860 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7960#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-25 18:42:24,860 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:42:24,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:42:24,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-11-25 18:42:24,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259637264] [2021-11-25 18:42:24,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:42:24,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-11-25 18:42:24,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:42:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-11-25 18:42:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7353, Unknown=0, NotChecked=0, Total=12432 [2021-11-25 18:42:24,869 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2021-11-25 18:42:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:30,582 INFO L93 Difference]: Finished difference Result 770 states and 818 transitions. [2021-11-25 18:42:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-25 18:42:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) Word has length 382 [2021-11-25 18:42:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:30,590 INFO L225 Difference]: With dead ends: 770 [2021-11-25 18:42:30,591 INFO L226 Difference]: Without dead ends: 765 [2021-11-25 18:42:30,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1034 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8733 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14054, Invalid=27766, Unknown=0, NotChecked=0, Total=41820 [2021-11-25 18:42:30,606 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 1266 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:30,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1266 Valid, 622 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-25 18:42:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-25 18:42:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2021-11-25 18:42:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 572 states have (on average 1.0017482517482517) internal successors, (573), 572 states have internal predecessors, (573), 97 states have call successors, (97), 96 states have call predecessors, (97), 95 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2021-11-25 18:42:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 766 transitions. [2021-11-25 18:42:30,690 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 766 transitions. Word has length 382 [2021-11-25 18:42:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:30,692 INFO L470 AbstractCegarLoop]: Abstraction has 765 states and 766 transitions. [2021-11-25 18:42:30,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2021-11-25 18:42:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 766 transitions. [2021-11-25 18:42:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2021-11-25 18:42:30,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:30,740 INFO L514 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:42:30,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:42:30,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 18:42:30,960 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:42:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1053987256, now seen corresponding path program 6 times [2021-11-25 18:42:30,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:42:30,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106707913] [2021-11-25 18:42:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:30,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:42:30,991 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:42:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865511174] [2021-11-25 18:42:30,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:42:30,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:42:30,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:42:30,995 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:42:31,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 18:42:59,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:42:59,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:42:59,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 191 conjunts are in the unsatisfiable core [2021-11-25 18:42:59,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:43:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 35346 backedges. 188 proven. 35156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:43:03,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:43:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35346 backedges. 188 proven. 17672 refuted. 0 times theorem prover too weak. 17486 trivial. 0 not checked. [2021-11-25 18:43:05,560 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:43:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106707913] [2021-11-25 18:43:05,561 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-25 18:43:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865511174] [2021-11-25 18:43:05,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865511174] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:43:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877927871] [2021-11-25 18:43:05,563 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-25 18:43:05,563 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:43:05,563 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:43:05,563 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:43:05,564 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:43:06,349 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 79 for LOIs [2021-11-25 18:43:06,820 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2021-11-25 18:43:06,853 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:43:13,491 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14967#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_81| Int) (|v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_133| Int) (|v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_81| Int) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_73| Int)) (and (<= |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_133| 2147483647) (<= 0 (+ 4294967295 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_81|)) (or (and (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (= |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_81| 1) (= |#NULL.offset| 0) (= ~counter~0 2) (= |#NULL.base| 0))) (= (ite (= (+ (* 2 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_81|) (* |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_81| |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_81|)) (+ (* 4 |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_133|) (* |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_81| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_81|) (* 2 |v_ULTIMATE.start_main_~u~0#1_BEFORE_CALL_81|) (* 4 |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_73|))) 1 0) |__VERIFIER_assert_#in~cond|) (<= 0 (+ |v_ULTIMATE.start_main_~A~0#1_BEFORE_CALL_133| 2147483648)) (<= 1 |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_81|))) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-25 18:43:13,491 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:43:13,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-25 18:43:13,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-11-25 18:43:13,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264750838] [2021-11-25 18:43:13,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-25 18:43:13,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-11-25 18:43:13,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:43:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-11-25 18:43:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5696, Invalid=7876, Unknown=0, NotChecked=0, Total=13572 [2021-11-25 18:43:13,499 INFO L87 Difference]: Start difference. First operand 765 states and 766 transitions. Second operand has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) [2021-11-25 18:43:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:43:18,812 INFO L93 Difference]: Finished difference Result 818 states and 824 transitions. [2021-11-25 18:43:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-11-25 18:43:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) Word has length 766 [2021-11-25 18:43:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:43:18,820 INFO L225 Difference]: With dead ends: 818 [2021-11-25 18:43:18,820 INFO L226 Difference]: Without dead ends: 813 [2021-11-25 18:43:18,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2395 GetRequests, 2179 SyntacticMatches, 2 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8037 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=15889, Invalid=30551, Unknown=0, NotChecked=0, Total=46440 [2021-11-25 18:43:18,827 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 604 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:43:18,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 556 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 18:43:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-11-25 18:43:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2021-11-25 18:43:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 608 states have (on average 1.0016447368421053) internal successors, (609), 608 states have internal predecessors, (609), 103 states have call successors, (103), 102 states have call predecessors, (103), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2021-11-25 18:43:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 814 transitions. [2021-11-25 18:43:18,878 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 814 transitions. Word has length 766 [2021-11-25 18:43:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:43:18,880 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 814 transitions. [2021-11-25 18:43:18,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) [2021-11-25 18:43:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 814 transitions. [2021-11-25 18:43:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2021-11-25 18:43:18,890 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:43:18,891 INFO L514 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:43:18,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 18:43:19,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:43:19,092 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:43:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:43:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1872537714, now seen corresponding path program 7 times [2021-11-25 18:43:19,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:43:19,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694995795] [2021-11-25 18:43:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:43:19,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:43:19,129 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-25 18:43:19,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135543215] [2021-11-25 18:43:19,129 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:43:19,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:43:19,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:43:19,131 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:43:19,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 18:44:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:44:58,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 18:45:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:45:05,927 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 18:45:05,928 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 18:45:05,929 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 18:45:05,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 18:45:06,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:45:06,134 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2021-11-25 18:45:06,138 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:45:06,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:45:06 BoogieIcfgContainer [2021-11-25 18:45:06,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:45:06,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:45:06,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:45:06,374 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:45:06,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:38:04" (3/4) ... [2021-11-25 18:45:06,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 18:45:06,646 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 18:45:06,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:45:06,647 INFO L158 Benchmark]: Toolchain (without parser) took 423104.91ms. Allocated memory was 104.9MB in the beginning and 220.2MB in the end (delta: 115.3MB). Free memory was 70.0MB in the beginning and 54.7MB in the end (delta: 15.3MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2021-11-25 18:45:06,648 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:45:06,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.09ms. Allocated memory is still 104.9MB. Free memory was 69.9MB in the beginning and 78.9MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:45:06,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.28ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 77.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:45:06,649 INFO L158 Benchmark]: Boogie Preprocessor took 43.42ms. Allocated memory is still 104.9MB. Free memory was 77.6MB in the beginning and 76.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:45:06,650 INFO L158 Benchmark]: RCFGBuilder took 381.43ms. Allocated memory is still 104.9MB. Free memory was 76.5MB in the beginning and 66.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 18:45:06,650 INFO L158 Benchmark]: TraceAbstraction took 421968.67ms. Allocated memory was 104.9MB in the beginning and 220.2MB in the end (delta: 115.3MB). Free memory was 65.6MB in the beginning and 88.6MB in the end (delta: -22.9MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2021-11-25 18:45:06,651 INFO L158 Benchmark]: Witness Printer took 272.56ms. Allocated memory is still 220.2MB. Free memory was 88.6MB in the beginning and 54.7MB in the end (delta: 33.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-25 18:45:06,657 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.35ms. Allocated memory is still 104.9MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.09ms. Allocated memory is still 104.9MB. Free memory was 69.9MB in the beginning and 78.9MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.28ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 77.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.42ms. Allocated memory is still 104.9MB. Free memory was 77.6MB in the beginning and 76.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.43ms. Allocated memory is still 104.9MB. Free memory was 76.5MB in the beginning and 66.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 421968.67ms. Allocated memory was 104.9MB in the beginning and 220.2MB in the end (delta: 115.3MB). Free memory was 65.6MB in the beginning and 88.6MB in the end (delta: -22.9MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 272.56ms. Allocated memory is still 220.2MB. Free memory was 88.6MB in the beginning and 54.7MB in the end (delta: 33.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=164691, counter=0, R=406] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=164691, counter=0, R=406] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=164691, counter=0, R=406, r=145, u=813, v=1] [L34] EXPR counter++ VAL [A=164691, counter=1, counter++=0, r=145, R=406, u=813, v=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=1, r=145, R=406, u=813, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=1, r=144, R=406, u=813, v=3] [L34] EXPR counter++ VAL [A=164691, counter=2, counter++=1, R=406, r=144, u=813, v=3] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=2, R=406, r=144, u=813, v=3] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=2, r=141, R=406, u=813, v=5] [L34] EXPR counter++ VAL [A=164691, counter=3, counter++=2, R=406, r=141, u=813, v=5] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=3, R=406, r=141, u=813, v=5] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=3, R=406, r=136, u=813, v=7] [L34] EXPR counter++ VAL [A=164691, counter=4, counter++=3, r=136, R=406, u=813, v=7] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=4, r=136, R=406, u=813, v=7] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=4, r=129, R=406, u=813, v=9] [L34] EXPR counter++ VAL [A=164691, counter=5, counter++=4, R=406, r=129, u=813, v=9] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=5, r=129, R=406, u=813, v=9] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=5, R=406, r=120, u=813, v=11] [L34] EXPR counter++ VAL [A=164691, counter=6, counter++=5, r=120, R=406, u=813, v=11] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=6, R=406, r=120, u=813, v=11] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=6, r=109, R=406, u=813, v=13] [L34] EXPR counter++ VAL [A=164691, counter=7, counter++=6, r=109, R=406, u=813, v=13] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=7, R=406, r=109, u=813, v=13] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=7, r=96, R=406, u=813, v=15] [L34] EXPR counter++ VAL [A=164691, counter=8, counter++=7, R=406, r=96, u=813, v=15] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=8, R=406, r=96, u=813, v=15] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=8, R=406, r=81, u=813, v=17] [L34] EXPR counter++ VAL [A=164691, counter=9, counter++=8, R=406, r=81, u=813, v=17] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=9, r=81, R=406, u=813, v=17] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=9, R=406, r=64, u=813, v=19] [L34] EXPR counter++ VAL [A=164691, counter=10, counter++=9, R=406, r=64, u=813, v=19] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=10, r=64, R=406, u=813, v=19] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=10, r=45, R=406, u=813, v=21] [L34] EXPR counter++ VAL [A=164691, counter=11, counter++=10, R=406, r=45, u=813, v=21] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=11, R=406, r=45, u=813, v=21] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=11, r=24, R=406, u=813, v=23] [L34] EXPR counter++ VAL [A=164691, counter=12, counter++=11, r=24, R=406, u=813, v=23] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=12, R=406, r=24, u=813, v=23] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=12, R=406, r=1, u=813, v=25] [L34] EXPR counter++ VAL [A=164691, counter=13, counter++=12, R=406, r=1, u=813, v=25] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=13, r=1, R=406, u=813, v=25] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=13, r=-24, R=406, u=813, v=27] [L34] EXPR counter++ VAL [A=164691, counter=14, counter++=13, r=-24, R=406, u=813, v=27] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=14, R=406, r=-24, u=813, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=14, r=789, R=406, u=815, v=27] [L34] EXPR counter++ VAL [A=164691, counter=15, counter++=14, r=789, R=406, u=815, v=27] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=15, r=789, R=406, u=815, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=15, R=406, r=762, u=815, v=29] [L34] EXPR counter++ VAL [A=164691, counter=16, counter++=15, r=762, R=406, u=815, v=29] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=16, R=406, r=762, u=815, v=29] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=16, R=406, r=733, u=815, v=31] [L34] EXPR counter++ VAL [A=164691, counter=17, counter++=16, R=406, r=733, u=815, v=31] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=17, R=406, r=733, u=815, v=31] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=17, R=406, r=702, u=815, v=33] [L34] EXPR counter++ VAL [A=164691, counter=18, counter++=17, r=702, R=406, u=815, v=33] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=18, r=702, R=406, u=815, v=33] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=18, R=406, r=669, u=815, v=35] [L34] EXPR counter++ VAL [A=164691, counter=19, counter++=18, R=406, r=669, u=815, v=35] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=19, R=406, r=669, u=815, v=35] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=19, R=406, r=634, u=815, v=37] [L34] EXPR counter++ VAL [A=164691, counter=20, counter++=19, R=406, r=634, u=815, v=37] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=20, R=406, r=634, u=815, v=37] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=20, r=597, R=406, u=815, v=39] [L34] EXPR counter++ VAL [A=164691, counter=21, counter++=20, r=597, R=406, u=815, v=39] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=21, r=597, R=406, u=815, v=39] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=21, r=558, R=406, u=815, v=41] [L34] EXPR counter++ VAL [A=164691, counter=22, counter++=21, R=406, r=558, u=815, v=41] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=22, R=406, r=558, u=815, v=41] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=22, R=406, r=517, u=815, v=43] [L34] EXPR counter++ VAL [A=164691, counter=23, counter++=22, r=517, R=406, u=815, v=43] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=23, r=517, R=406, u=815, v=43] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=23, R=406, r=474, u=815, v=45] [L34] EXPR counter++ VAL [A=164691, counter=24, counter++=23, R=406, r=474, u=815, v=45] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=24, R=406, r=474, u=815, v=45] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=24, r=429, R=406, u=815, v=47] [L34] EXPR counter++ VAL [A=164691, counter=25, counter++=24, R=406, r=429, u=815, v=47] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=25, R=406, r=429, u=815, v=47] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=25, r=382, R=406, u=815, v=49] [L34] EXPR counter++ VAL [A=164691, counter=26, counter++=25, r=382, R=406, u=815, v=49] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=26, r=382, R=406, u=815, v=49] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=26, R=406, r=333, u=815, v=51] [L34] EXPR counter++ VAL [A=164691, counter=27, counter++=26, R=406, r=333, u=815, v=51] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=27, R=406, r=333, u=815, v=51] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=27, R=406, r=282, u=815, v=53] [L34] EXPR counter++ VAL [A=164691, counter=28, counter++=27, r=282, R=406, u=815, v=53] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=28, r=282, R=406, u=815, v=53] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=28, r=229, R=406, u=815, v=55] [L34] EXPR counter++ VAL [A=164691, counter=29, counter++=28, r=229, R=406, u=815, v=55] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=29, r=229, R=406, u=815, v=55] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=29, r=174, R=406, u=815, v=57] [L34] EXPR counter++ VAL [A=164691, counter=30, counter++=29, R=406, r=174, u=815, v=57] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=30, r=174, R=406, u=815, v=57] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=30, r=117, R=406, u=815, v=59] [L34] EXPR counter++ VAL [A=164691, counter=31, counter++=30, r=117, R=406, u=815, v=59] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=31, R=406, r=117, u=815, v=59] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=31, r=58, R=406, u=815, v=61] [L34] EXPR counter++ VAL [A=164691, counter=32, counter++=31, r=58, R=406, u=815, v=61] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=32, r=58, R=406, u=815, v=61] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=32, R=406, r=-3, u=815, v=63] [L34] EXPR counter++ VAL [A=164691, counter=33, counter++=32, R=406, r=-3, u=815, v=63] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=33, R=406, r=-3, u=815, v=63] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=33, r=812, R=406, u=817, v=63] [L34] EXPR counter++ VAL [A=164691, counter=34, counter++=33, R=406, r=812, u=817, v=63] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=34, R=406, r=812, u=817, v=63] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=34, r=749, R=406, u=817, v=65] [L34] EXPR counter++ VAL [A=164691, counter=35, counter++=34, r=749, R=406, u=817, v=65] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=35, r=749, R=406, u=817, v=65] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=35, r=684, R=406, u=817, v=67] [L34] EXPR counter++ VAL [A=164691, counter=36, counter++=35, r=684, R=406, u=817, v=67] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=36, r=684, R=406, u=817, v=67] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=36, r=617, R=406, u=817, v=69] [L34] EXPR counter++ VAL [A=164691, counter=37, counter++=36, R=406, r=617, u=817, v=69] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=37, r=617, R=406, u=817, v=69] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=37, R=406, r=548, u=817, v=71] [L34] EXPR counter++ VAL [A=164691, counter=38, counter++=37, R=406, r=548, u=817, v=71] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=38, r=548, R=406, u=817, v=71] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=38, R=406, r=477, u=817, v=73] [L34] EXPR counter++ VAL [A=164691, counter=39, counter++=38, r=477, R=406, u=817, v=73] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=39, R=406, r=477, u=817, v=73] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=39, R=406, r=404, u=817, v=75] [L34] EXPR counter++ VAL [A=164691, counter=40, counter++=39, r=404, R=406, u=817, v=75] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=40, r=404, R=406, u=817, v=75] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=40, r=329, R=406, u=817, v=77] [L34] EXPR counter++ VAL [A=164691, counter=41, counter++=40, R=406, r=329, u=817, v=77] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=41, R=406, r=329, u=817, v=77] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=41, R=406, r=252, u=817, v=79] [L34] EXPR counter++ VAL [A=164691, counter=42, counter++=41, r=252, R=406, u=817, v=79] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=42, R=406, r=252, u=817, v=79] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=42, R=406, r=173, u=817, v=81] [L34] EXPR counter++ VAL [A=164691, counter=43, counter++=42, R=406, r=173, u=817, v=81] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=43, r=173, R=406, u=817, v=81] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=43, R=406, r=92, u=817, v=83] [L34] EXPR counter++ VAL [A=164691, counter=44, counter++=43, R=406, r=92, u=817, v=83] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=44, r=92, R=406, u=817, v=83] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=44, R=406, r=9, u=817, v=85] [L34] EXPR counter++ VAL [A=164691, counter=45, counter++=44, R=406, r=9, u=817, v=85] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=45, r=9, R=406, u=817, v=85] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=45, r=-76, R=406, u=817, v=87] [L34] EXPR counter++ VAL [A=164691, counter=46, counter++=45, R=406, r=-76, u=817, v=87] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=46, R=406, r=-76, u=817, v=87] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=46, R=406, r=741, u=819, v=87] [L34] EXPR counter++ VAL [A=164691, counter=47, counter++=46, R=406, r=741, u=819, v=87] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=47, R=406, r=741, u=819, v=87] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=47, R=406, r=654, u=819, v=89] [L34] EXPR counter++ VAL [A=164691, counter=48, counter++=47, r=654, R=406, u=819, v=89] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=48, r=654, R=406, u=819, v=89] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=48, r=565, R=406, u=819, v=91] [L34] EXPR counter++ VAL [A=164691, counter=49, counter++=48, R=406, r=565, u=819, v=91] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=49, R=406, r=565, u=819, v=91] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=49, R=406, r=474, u=819, v=93] [L34] EXPR counter++ VAL [A=164691, counter=50, counter++=49, r=474, R=406, u=819, v=93] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=50, R=406, r=474, u=819, v=93] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=50, R=406, r=381, u=819, v=95] [L34] EXPR counter++ VAL [A=164691, counter=51, counter++=50, r=381, R=406, u=819, v=95] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=51] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=51, R=406, r=381, u=819, v=95] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=51, R=406, r=286, u=819, v=97] [L34] EXPR counter++ VAL [A=164691, counter=52, counter++=51, R=406, r=286, u=819, v=97] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=52] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=52, R=406, r=286, u=819, v=97] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=52, R=406, r=189, u=819, v=99] [L34] EXPR counter++ VAL [A=164691, counter=53, counter++=52, r=189, R=406, u=819, v=99] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=53] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=53, r=189, R=406, u=819, v=99] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=53, r=90, R=406, u=819, v=101] [L34] EXPR counter++ VAL [A=164691, counter=54, counter++=53, R=406, r=90, u=819, v=101] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=54] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=54, r=90, R=406, u=819, v=101] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=54, R=406, r=-11, u=819, v=103] [L34] EXPR counter++ VAL [A=164691, counter=55, counter++=54, R=406, r=-11, u=819, v=103] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=55] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=55, R=406, r=-11, u=819, v=103] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=55, R=406, r=808, u=821, v=103] [L34] EXPR counter++ VAL [A=164691, counter=56, counter++=55, R=406, r=808, u=821, v=103] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=56] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=56, r=808, R=406, u=821, v=103] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=56, R=406, r=705, u=821, v=105] [L34] EXPR counter++ VAL [A=164691, counter=57, counter++=56, R=406, r=705, u=821, v=105] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=57] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=57, r=705, R=406, u=821, v=105] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=57, r=600, R=406, u=821, v=107] [L34] EXPR counter++ VAL [A=164691, counter=58, counter++=57, r=600, R=406, u=821, v=107] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=58] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=58, R=406, r=600, u=821, v=107] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=58, R=406, r=493, u=821, v=109] [L34] EXPR counter++ VAL [A=164691, counter=59, counter++=58, r=493, R=406, u=821, v=109] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=59] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=59, R=406, r=493, u=821, v=109] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=59, r=384, R=406, u=821, v=111] [L34] EXPR counter++ VAL [A=164691, counter=60, counter++=59, R=406, r=384, u=821, v=111] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=60] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=60, R=406, r=384, u=821, v=111] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=60, R=406, r=273, u=821, v=113] [L34] EXPR counter++ VAL [A=164691, counter=61, counter++=60, R=406, r=273, u=821, v=113] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=61] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=61, R=406, r=273, u=821, v=113] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=61, r=160, R=406, u=821, v=115] [L34] EXPR counter++ VAL [A=164691, counter=62, counter++=61, R=406, r=160, u=821, v=115] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=62] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=62, r=160, R=406, u=821, v=115] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=62, r=45, R=406, u=821, v=117] [L34] EXPR counter++ VAL [A=164691, counter=63, counter++=62, r=45, R=406, u=821, v=117] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=63] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=63, r=45, R=406, u=821, v=117] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=63, r=-72, R=406, u=821, v=119] [L34] EXPR counter++ VAL [A=164691, counter=64, counter++=63, R=406, r=-72, u=821, v=119] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=64] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=64, R=406, r=-72, u=821, v=119] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=64, r=749, R=406, u=823, v=119] [L34] EXPR counter++ VAL [A=164691, counter=65, counter++=64, r=749, R=406, u=823, v=119] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=65] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=65, r=749, R=406, u=823, v=119] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=65, R=406, r=630, u=823, v=121] [L34] EXPR counter++ VAL [A=164691, counter=66, counter++=65, r=630, R=406, u=823, v=121] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=66] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=66, r=630, R=406, u=823, v=121] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=66, R=406, r=509, u=823, v=123] [L34] EXPR counter++ VAL [A=164691, counter=67, counter++=66, R=406, r=509, u=823, v=123] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=67] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=67, R=406, r=509, u=823, v=123] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=67, r=386, R=406, u=823, v=125] [L34] EXPR counter++ VAL [A=164691, counter=68, counter++=67, r=386, R=406, u=823, v=125] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=68] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=68, R=406, r=386, u=823, v=125] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=68, R=406, r=261, u=823, v=127] [L34] EXPR counter++ VAL [A=164691, counter=69, counter++=68, R=406, r=261, u=823, v=127] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=69] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=69, r=261, R=406, u=823, v=127] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=69, r=134, R=406, u=823, v=129] [L34] EXPR counter++ VAL [A=164691, counter=70, counter++=69, r=134, R=406, u=823, v=129] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=70] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=70, R=406, r=134, u=823, v=129] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=70, r=5, R=406, u=823, v=131] [L34] EXPR counter++ VAL [A=164691, counter=71, counter++=70, r=5, R=406, u=823, v=131] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=71] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=71, r=5, R=406, u=823, v=131] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=71, R=406, r=-126, u=823, v=133] [L34] EXPR counter++ VAL [A=164691, counter=72, counter++=71, R=406, r=-126, u=823, v=133] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=72] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=72, R=406, r=-126, u=823, v=133] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=72, r=697, R=406, u=825, v=133] [L34] EXPR counter++ VAL [A=164691, counter=73, counter++=72, R=406, r=697, u=825, v=133] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=73] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=73, r=697, R=406, u=825, v=133] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=73, R=406, r=564, u=825, v=135] [L34] EXPR counter++ VAL [A=164691, counter=74, counter++=73, r=564, R=406, u=825, v=135] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=74] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=74, r=564, R=406, u=825, v=135] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=74, r=429, R=406, u=825, v=137] [L34] EXPR counter++ VAL [A=164691, counter=75, counter++=74, r=429, R=406, u=825, v=137] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=75] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=75, r=429, R=406, u=825, v=137] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=75, r=292, R=406, u=825, v=139] [L34] EXPR counter++ VAL [A=164691, counter=76, counter++=75, r=292, R=406, u=825, v=139] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=76] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=76, r=292, R=406, u=825, v=139] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=76, R=406, r=153, u=825, v=141] [L34] EXPR counter++ VAL [A=164691, counter=77, counter++=76, r=153, R=406, u=825, v=141] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=77] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=77, R=406, r=153, u=825, v=141] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=77, R=406, r=12, u=825, v=143] [L34] EXPR counter++ VAL [A=164691, counter=78, counter++=77, r=12, R=406, u=825, v=143] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=78] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=78, r=12, R=406, u=825, v=143] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=78, R=406, r=-131, u=825, v=145] [L34] EXPR counter++ VAL [A=164691, counter=79, counter++=78, R=406, r=-131, u=825, v=145] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=79] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=79, r=-131, R=406, u=825, v=145] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=79, R=406, r=694, u=827, v=145] [L34] EXPR counter++ VAL [A=164691, counter=80, counter++=79, r=694, R=406, u=827, v=145] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=80] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=80, R=406, r=694, u=827, v=145] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=80, R=406, r=549, u=827, v=147] [L34] EXPR counter++ VAL [A=164691, counter=81, counter++=80, r=549, R=406, u=827, v=147] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=81] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=81, r=549, R=406, u=827, v=147] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=81, r=402, R=406, u=827, v=149] [L34] EXPR counter++ VAL [A=164691, counter=82, counter++=81, r=402, R=406, u=827, v=149] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=82] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=82, r=402, R=406, u=827, v=149] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=82, r=253, R=406, u=827, v=151] [L34] EXPR counter++ VAL [A=164691, counter=83, counter++=82, R=406, r=253, u=827, v=151] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=83] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=83, R=406, r=253, u=827, v=151] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=83, r=102, R=406, u=827, v=153] [L34] EXPR counter++ VAL [A=164691, counter=84, counter++=83, r=102, R=406, u=827, v=153] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=84] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=84, R=406, r=102, u=827, v=153] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=84, R=406, r=-51, u=827, v=155] [L34] EXPR counter++ VAL [A=164691, counter=85, counter++=84, r=-51, R=406, u=827, v=155] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=85] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=85, r=-51, R=406, u=827, v=155] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=85, R=406, r=776, u=829, v=155] [L34] EXPR counter++ VAL [A=164691, counter=86, counter++=85, R=406, r=776, u=829, v=155] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=86] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=86, R=406, r=776, u=829, v=155] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=86, r=621, R=406, u=829, v=157] [L34] EXPR counter++ VAL [A=164691, counter=87, counter++=86, R=406, r=621, u=829, v=157] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=87] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=87, R=406, r=621, u=829, v=157] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=87, r=464, R=406, u=829, v=159] [L34] EXPR counter++ VAL [A=164691, counter=88, counter++=87, r=464, R=406, u=829, v=159] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=88] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=88, r=464, R=406, u=829, v=159] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=88, r=305, R=406, u=829, v=161] [L34] EXPR counter++ VAL [A=164691, counter=89, counter++=88, R=406, r=305, u=829, v=161] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=89] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=89, R=406, r=305, u=829, v=161] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=89, R=406, r=144, u=829, v=163] [L34] EXPR counter++ VAL [A=164691, counter=90, counter++=89, r=144, R=406, u=829, v=163] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=90] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=90, R=406, r=144, u=829, v=163] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=90, r=-19, R=406, u=829, v=165] [L34] EXPR counter++ VAL [A=164691, counter=91, counter++=90, R=406, r=-19, u=829, v=165] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=91] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=91, R=406, r=-19, u=829, v=165] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=91, R=406, r=810, u=831, v=165] [L34] EXPR counter++ VAL [A=164691, counter=92, counter++=91, r=810, R=406, u=831, v=165] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=92] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=92, R=406, r=810, u=831, v=165] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=92, R=406, r=645, u=831, v=167] [L34] EXPR counter++ VAL [A=164691, counter=93, counter++=92, r=645, R=406, u=831, v=167] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=93] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=93, R=406, r=645, u=831, v=167] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=93, R=406, r=478, u=831, v=169] [L34] EXPR counter++ VAL [A=164691, counter=94, counter++=93, r=478, R=406, u=831, v=169] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=94] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=94, R=406, r=478, u=831, v=169] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=94, R=406, r=309, u=831, v=171] [L34] EXPR counter++ VAL [A=164691, counter=95, counter++=94, r=309, R=406, u=831, v=171] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=95] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=95, r=309, R=406, u=831, v=171] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=95, R=406, r=138, u=831, v=173] [L34] EXPR counter++ VAL [A=164691, counter=96, counter++=95, R=406, r=138, u=831, v=173] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=96] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=96, R=406, r=138, u=831, v=173] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=96, r=-35, R=406, u=831, v=175] [L34] EXPR counter++ VAL [A=164691, counter=97, counter++=96, r=-35, R=406, u=831, v=175] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=97] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=97, R=406, r=-35, u=831, v=175] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=97, r=796, R=406, u=833, v=175] [L34] EXPR counter++ VAL [A=164691, counter=98, counter++=97, r=796, R=406, u=833, v=175] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=98] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=98, r=796, R=406, u=833, v=175] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=98, r=621, R=406, u=833, v=177] [L34] EXPR counter++ VAL [A=164691, counter=99, counter++=98, r=621, R=406, u=833, v=177] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=99] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=99, r=621, R=406, u=833, v=177] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=99, R=406, r=444, u=833, v=179] [L34] EXPR counter++ VAL [A=164691, counter=100, counter++=99, R=406, r=444, u=833, v=179] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=100] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=100, R=406, r=444, u=833, v=179] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=100, r=265, R=406, u=833, v=181] [L34] EXPR counter++ VAL [A=164691, counter=101, counter++=100, r=265, R=406, u=833, v=181] [L34] COND FALSE !(counter++<100) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=101] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 421.7s, OverallIterations: 13, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2673 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2671 mSDsluCounter, 2055 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32 IncrementalHoareTripleChecker+Unchecked, 1936 mSDsCounter, 1107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2423 IncrementalHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1107 mSolverCounterUnsat, 438 mSDtfsCounter, 2423 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5005 GetRequests, 4282 SyntacticMatches, 12 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21680 ImplicationChecksByTransitivity, 59.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=12, InterpolantAutomatonStates: 604, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 309.6s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 2425 NumberOfCodeBlocks, 2425 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3160 ConstructedInterpolants, 0 QuantifiedInterpolants, 8437 SizeOfPredicates, 196 NumberOfNonLiveVariables, 3686 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 23531/92504 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: OVERALL_TIME: 1.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.5s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME: 1.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 46, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 10, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 145, DAG_COMPRESSION_RETAINED_NODES: 50, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-25 18:45:06,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621ce86f-9a0c-49bb-8bfc-3ccfbdccf68b/bin/utaipan-eEHZpOm5b7/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