./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur --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 c55d57654781cf0634666e1c7d4e43dff0d9410f4306aded3e4e446e1f9e88d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:38:46,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:38:46,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:38:46,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:38:46,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:38:46,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:38:46,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:38:46,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:38:46,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:38:46,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:38:46,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:38:46,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:38:46,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:38:46,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:38:46,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:38:46,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:38:46,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:38:46,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:38:46,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:38:46,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:38:46,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:38:46,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:38:46,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:38:46,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:38:46,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:38:46,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:38:46,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:38:46,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:38:46,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:38:46,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:38:46,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:38:46,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:38:46,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:38:46,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:38:46,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:38:46,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:38:46,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:38:46,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:38:46,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:38:46,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:38:46,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:38:46,588 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:38:46,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:38:46,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:38:46,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:38:46,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:38:46,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:38:46,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:38:46,641 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:38:46,641 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:38:46,642 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:38:46,642 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:38:46,643 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:38:46,644 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:38:46,644 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:38:46,644 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:38:46,644 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:38:46,645 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:38:46,645 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:38:46,645 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:38:46,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:38:46,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:38:46,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:38:46,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:38:46,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:38:46,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:38:46,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:38:46,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:38:46,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:38:46,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:38:46,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:38:46,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:38:46,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:38:46,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:38:46,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:38:46,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:38:46,652 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:38:46,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:38:46,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:38:46,653 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:38:46,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:38:46,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:38:46,654 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:38:46,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/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_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur 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 -> c55d57654781cf0634666e1c7d4e43dff0d9410f4306aded3e4e446e1f9e88d1 [2022-11-25 23:38:46,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:38:47,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:38:47,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:38:47,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:38:47,033 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:38:47,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-11-25 23:38:50,371 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:38:50,673 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:38:50,674 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-11-25 23:38:50,694 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/data/dffd7932c/9e11754843bf451485d5059a43c42d5e/FLAGcb4fbc85d [2022-11-25 23:38:50,712 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/data/dffd7932c/9e11754843bf451485d5059a43c42d5e [2022-11-25 23:38:50,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:38:50,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:38:50,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:38:50,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:38:50,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:38:50,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:38:50" (1/1) ... [2022-11-25 23:38:50,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4f11ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:50, skipping insertion in model container [2022-11-25 23:38:50,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:38:50" (1/1) ... [2022-11-25 23:38:50,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:38:50,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:38:50,927 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-11-25 23:38:50,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:38:50,990 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:38:51,010 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-11-25 23:38:51,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:38:51,059 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:38:51,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51 WrapperNode [2022-11-25 23:38:51,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:38:51,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:38:51,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:38:51,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:38:51,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,119 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-11-25 23:38:51,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:38:51,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:38:51,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:38:51,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:38:51,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,163 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:38:51,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:38:51,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:38:51,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:38:51,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (1/1) ... [2022-11-25 23:38:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:38:51,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:51,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:38:51,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:38:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:38:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:38:51,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:38:51,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:38:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 23:38:51,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 23:38:51,353 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:38:51,356 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:38:51,601 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:38:51,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:38:51,618 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:38:51,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:38:51 BoogieIcfgContainer [2022-11-25 23:38:51,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:38:51,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:38:51,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:38:51,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:38:51,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:38:50" (1/3) ... [2022-11-25 23:38:51,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170b618a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:38:51, skipping insertion in model container [2022-11-25 23:38:51,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:51" (2/3) ... [2022-11-25 23:38:51,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170b618a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:38:51, skipping insertion in model container [2022-11-25 23:38:51,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:38:51" (3/3) ... [2022-11-25 23:38:51,630 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.c [2022-11-25 23:38:51,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:38:51,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:38:51,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:38:51,726 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@790b387b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:38:51,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:38:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 23:38:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:38:51,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:51,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:38:51,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:38:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1408153759, now seen corresponding path program 1 times [2022-11-25 23:38:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:51,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005352316] [2022-11-25 23:38:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:51,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:51,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005352316] [2022-11-25 23:38:51,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005352316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:51,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:51,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:51,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838420806] [2022-11-25 23:38:51,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:38:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:38:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:38:52,029 INFO L87 Difference]: Start difference. First operand has 23 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:52,065 INFO L93 Difference]: Finished difference Result 45 states and 82 transitions. [2022-11-25 23:38:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:38:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:38:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:52,076 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:38:52,077 INFO L226 Difference]: Without dead ends: 21 [2022-11-25 23:38:52,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:38:52,084 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:52,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:38:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-25 23:38:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 23:38:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:38:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2022-11-25 23:38:52,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 6 [2022-11-25 23:38:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:52,147 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2022-11-25 23:38:52,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2022-11-25 23:38:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:38:52,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:52,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:38:52,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:38:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1232571916, now seen corresponding path program 1 times [2022-11-25 23:38:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:52,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967076538] [2022-11-25 23:38:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:52,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:52,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967076538] [2022-11-25 23:38:52,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967076538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:52,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:52,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:38:52,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966272350] [2022-11-25 23:38:52,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:52,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:38:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:38:52,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:38:52,299 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:52,340 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2022-11-25 23:38:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:38:52,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:38:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:52,342 INFO L225 Difference]: With dead ends: 35 [2022-11-25 23:38:52,342 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 23:38:52,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:38:52,344 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:52,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:38:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 23:38:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 23:38:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:38:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2022-11-25 23:38:52,355 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 7 [2022-11-25 23:38:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:52,356 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-11-25 23:38:52,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-11-25 23:38:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:38:52,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:52,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:52,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:38:52,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:38:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1231022784, now seen corresponding path program 1 times [2022-11-25 23:38:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:52,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30715443] [2022-11-25 23:38:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:52,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:52,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30715443] [2022-11-25 23:38:52,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30715443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:52,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:52,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:38:52,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835287992] [2022-11-25 23:38:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:52,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:38:52,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:38:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:38:52,614 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:52,731 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-25 23:38:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:38:52,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:38:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:52,733 INFO L225 Difference]: With dead ends: 29 [2022-11-25 23:38:52,733 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 23:38:52,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:38:52,735 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:52,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 23:38:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 23:38:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:38:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-25 23:38:52,752 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2022-11-25 23:38:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:52,753 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-25 23:38:52,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-11-25 23:38:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:38:52,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:52,755 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:52,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:38:52,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:38:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1004679035, now seen corresponding path program 1 times [2022-11-25 23:38:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:52,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127151392] [2022-11-25 23:38:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:52,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:38:52,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937835566] [2022-11-25 23:38:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:52,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:52,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:52,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:38:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:52,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:38:52,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:53,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:53,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:53,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127151392] [2022-11-25 23:38:53,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:38:53,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937835566] [2022-11-25 23:38:53,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937835566] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:53,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933252574] [2022-11-25 23:38:53,466 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:38:53,467 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:53,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:53,476 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:53,477 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:38:53,700 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-25 23:38:53,721 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:54,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1933252574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:54,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:38:54,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2022-11-25 23:38:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120091820] [2022-11-25 23:38:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:54,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:38:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:38:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:38:54,316 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:38:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:54,771 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-11-25 23:38:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:38:54,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-25 23:38:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:54,776 INFO L225 Difference]: With dead ends: 49 [2022-11-25 23:38:54,776 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 23:38:54,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:38:54,782 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:54,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:38:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 23:38:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-25 23:38:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 23:38:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-11-25 23:38:54,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 12 [2022-11-25 23:38:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:54,830 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-11-25 23:38:54,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:38:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-11-25 23:38:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:38:54,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:54,832 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:54,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:55,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:55,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:38:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash 204620983, now seen corresponding path program 1 times [2022-11-25 23:38:55,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:55,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573763812] [2022-11-25 23:38:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:55,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:55,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:38:55,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630773640] [2022-11-25 23:38:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:55,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:55,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:55,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:55,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:38:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:55,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:38:55,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-25 23:38:55,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 23:38:55,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:55,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573763812] [2022-11-25 23:38:55,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:38:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630773640] [2022-11-25 23:38:55,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630773640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1228700600] [2022-11-25 23:38:55,293 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:38:55,293 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:55,294 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:55,294 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:55,294 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:00,071 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:39:00,078 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:01,295 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '790#(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 [2022-11-25 23:39:01,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:01,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:01,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-25 23:39:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411038362] [2022-11-25 23:39:01,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:01,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:39:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:39:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:39:01,298 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-25 23:39:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:01,573 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2022-11-25 23:39:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:39:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 40 [2022-11-25 23:39:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:01,578 INFO L225 Difference]: With dead ends: 107 [2022-11-25 23:39:01,578 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 23:39:01,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:39:01,586 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:01,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 232 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:39:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 23:39:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-11-25 23:39:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 23:39:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2022-11-25 23:39:01,637 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 40 [2022-11-25 23:39:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:01,638 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2022-11-25 23:39:01,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-25 23:39:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2022-11-25 23:39:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:39:01,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:01,641 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:01,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:01,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:01,848 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:01,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash 696736299, now seen corresponding path program 1 times [2022-11-25 23:39:01,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:01,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137317074] [2022-11-25 23:39:01,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:01,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:01,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:01,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971254670] [2022-11-25 23:39:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:01,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:01,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:39:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:01,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 23:39:01,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 23:39:02,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 23:39:02,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137317074] [2022-11-25 23:39:02,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:39:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971254670] [2022-11-25 23:39:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971254670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:39:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077244501] [2022-11-25 23:39:02,381 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 23:39:02,381 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:02,381 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:02,382 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:02,382 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:05,868 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-25 23:39:05,928 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:11,041 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1361#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:39:11,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:11,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:11,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-25 23:39:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690238206] [2022-11-25 23:39:11,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:39:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:39:11,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:39:11,044 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 23:39:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:11,728 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2022-11-25 23:39:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:39:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 40 [2022-11-25 23:39:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:11,730 INFO L225 Difference]: With dead ends: 105 [2022-11-25 23:39:11,730 INFO L226 Difference]: Without dead ends: 103 [2022-11-25 23:39:11,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:39:11,732 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:11,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:39:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-25 23:39:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-25 23:39:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 23:39:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2022-11-25 23:39:11,764 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 40 [2022-11-25 23:39:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:11,764 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2022-11-25 23:39:11,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-25 23:39:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-11-25 23:39:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:39:11,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:11,766 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:11,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:39:11,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:39:11,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1539244486, now seen corresponding path program 2 times [2022-11-25 23:39:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:11,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106106110] [2022-11-25 23:39:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:11,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:11,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329400385] [2022-11-25 23:39:11,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:39:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:11,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:12,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:39:12,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:39:12,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:39:12,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 23:39:12,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 23:39:12,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 23:39:12,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106106110] [2022-11-25 23:39:12,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:39:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329400385] [2022-11-25 23:39:12,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329400385] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:39:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1662715577] [2022-11-25 23:39:12,294 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 23:39:12,295 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:12,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:12,295 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:12,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:15,571 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-25 23:39:15,622 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:19,188 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1973#(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 [2022-11-25 23:39:19,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:19,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:19,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-25 23:39:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212937598] [2022-11-25 23:39:19,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:19,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:39:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:19,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:39:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:39:19,191 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-25 23:39:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:19,430 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-11-25 23:39:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:39:19,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-11-25 23:39:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:19,436 INFO L225 Difference]: With dead ends: 117 [2022-11-25 23:39:19,436 INFO L226 Difference]: Without dead ends: 115 [2022-11-25 23:39:19,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:39:19,440 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:19,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:39:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-25 23:39:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-25 23:39:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 64 states have internal predecessors, (68), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-25 23:39:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-11-25 23:39:19,488 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 45 [2022-11-25 23:39:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:19,493 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-11-25 23:39:19,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-25 23:39:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-11-25 23:39:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 23:39:19,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:19,498 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:19,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:19,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:19,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash -375151797, now seen corresponding path program 3 times [2022-11-25 23:39:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:19,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640133180] [2022-11-25 23:39:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:19,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:19,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737536732] [2022-11-25 23:39:19,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:39:19,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:19,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:19,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:19,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:39:19,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:39:19,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:39:19,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 23:39:19,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-25 23:39:19,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-25 23:39:20,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:20,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640133180] [2022-11-25 23:39:20,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:39:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737536732] [2022-11-25 23:39:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737536732] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:39:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136181775] [2022-11-25 23:39:20,705 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 23:39:20,705 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:20,705 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:20,706 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:20,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:24,330 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:39:24,335 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:25,339 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2643#(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 [2022-11-25 23:39:25,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:25,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:25,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-25 23:39:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206315012] [2022-11-25 23:39:25,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:39:25,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:25,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:39:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:39:25,342 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 23:39:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:26,469 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2022-11-25 23:39:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:39:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 50 [2022-11-25 23:39:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:26,473 INFO L225 Difference]: With dead ends: 141 [2022-11-25 23:39:26,473 INFO L226 Difference]: Without dead ends: 130 [2022-11-25 23:39:26,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:39:26,475 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:26,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:39:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-25 23:39:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-25 23:39:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 82 states have internal predecessors, (86), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-25 23:39:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-11-25 23:39:26,515 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 50 [2022-11-25 23:39:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:26,515 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-11-25 23:39:26,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 23:39:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-11-25 23:39:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 23:39:26,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:26,518 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:26,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 23:39:26,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:26,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash 780075682, now seen corresponding path program 1 times [2022-11-25 23:39:26,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:26,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211369955] [2022-11-25 23:39:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:26,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:26,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562919552] [2022-11-25 23:39:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:26,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:26,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:39:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:26,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 23:39:26,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-25 23:39:27,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-25 23:39:27,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:27,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211369955] [2022-11-25 23:39:27,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:39:27,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562919552] [2022-11-25 23:39:27,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562919552] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:39:27,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1697320034] [2022-11-25 23:39:27,998 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:39:27,999 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:27,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:27,999 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:28,000 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:31,632 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:39:31,643 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:32,918 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3455#(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 [2022-11-25 23:39:32,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:32,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:32,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-25 23:39:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889007715] [2022-11-25 23:39:32,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:32,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:39:32,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:39:32,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:39:32,921 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-25 23:39:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:33,753 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-25 23:39:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:39:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 66 [2022-11-25 23:39:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:33,756 INFO L225 Difference]: With dead ends: 146 [2022-11-25 23:39:33,757 INFO L226 Difference]: Without dead ends: 142 [2022-11-25 23:39:33,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:39:33,764 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:33,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:39:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-25 23:39:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-25 23:39:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 90 states have internal predecessors, (93), 31 states have call successors, (31), 24 states have call predecessors, (31), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-25 23:39:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2022-11-25 23:39:33,808 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 66 [2022-11-25 23:39:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:33,809 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2022-11-25 23:39:33,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-25 23:39:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2022-11-25 23:39:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 23:39:33,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:33,811 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:33,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:34,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:34,018 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1686864157, now seen corresponding path program 1 times [2022-11-25 23:39:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:34,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377887138] [2022-11-25 23:39:34,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:34,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:34,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579215429] [2022-11-25 23:39:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:34,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:34,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:34,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:39:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:34,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 23:39:34,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-11-25 23:39:34,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:34,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:34,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377887138] [2022-11-25 23:39:34,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:39:34,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579215429] [2022-11-25 23:39:34,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579215429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:34,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2114866851] [2022-11-25 23:39:34,548 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:39:34,548 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:34,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:34,549 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:34,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:37,400 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-25 23:39:37,442 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:43,845 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4244#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:39:43,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:43,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:39:43,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-11-25 23:39:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476521212] [2022-11-25 23:39:43,846 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:43,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:39:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:39:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:39:43,848 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-25 23:39:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:44,235 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2022-11-25 23:39:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:39:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 71 [2022-11-25 23:39:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:44,238 INFO L225 Difference]: With dead ends: 144 [2022-11-25 23:39:44,238 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 23:39:44,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:39:44,239 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:44,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 56 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:39:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 23:39:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-25 23:39:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 85 states have internal predecessors, (87), 28 states have call successors, (28), 22 states have call predecessors, (28), 22 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-25 23:39:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-11-25 23:39:44,279 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 71 [2022-11-25 23:39:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:44,280 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-11-25 23:39:44,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-25 23:39:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-11-25 23:39:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 23:39:44,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:44,282 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-11-25 23:39:44,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:44,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:44,488 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash -226115244, now seen corresponding path program 4 times [2022-11-25 23:39:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:44,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150628292] [2022-11-25 23:39:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:44,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176320160] [2022-11-25 23:39:44,512 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:39:44,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:44,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:44,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:39:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:44,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 23:39:44,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 52 proven. 50 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-25 23:39:44,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 52 proven. 50 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-25 23:39:45,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150628292] [2022-11-25 23:39:45,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:39:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176320160] [2022-11-25 23:39:45,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176320160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:39:45,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453289935] [2022-11-25 23:39:45,235 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 23:39:45,235 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:45,235 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:45,236 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:45,236 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:47,881 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-25 23:39:47,919 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:53,146 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5105#(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 [2022-11-25 23:39:53,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:53,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:53,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-25 23:39:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913738774] [2022-11-25 23:39:53,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:53,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:39:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:39:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:39:53,150 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 9 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2022-11-25 23:39:56,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:39:58,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:39:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:58,936 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2022-11-25 23:39:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:39:58,937 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 9 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) Word has length 73 [2022-11-25 23:39:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:58,938 INFO L225 Difference]: With dead ends: 158 [2022-11-25 23:39:58,938 INFO L226 Difference]: Without dead ends: 154 [2022-11-25 23:39:58,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:39:58,940 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:58,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 567 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 23:39:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-25 23:39:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2022-11-25 23:39:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 89 states have internal predecessors, (91), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-25 23:39:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2022-11-25 23:39:58,981 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 73 [2022-11-25 23:39:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:58,981 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2022-11-25 23:39:58,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 9 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2022-11-25 23:39:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-11-25 23:39:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 23:39:58,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:58,984 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:58,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:59,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:39:59,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:39:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1857500541, now seen corresponding path program 2 times [2022-11-25 23:39:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:59,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746207119] [2022-11-25 23:39:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:59,200 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:39:59,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807315214] [2022-11-25 23:39:59,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:39:59,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:59,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:59,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:39:59,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:39:59,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:39:59,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:39:59,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 107 proven. 41 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-11-25 23:40:00,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 107 proven. 41 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-11-25 23:40:01,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:01,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746207119] [2022-11-25 23:40:01,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:40:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807315214] [2022-11-25 23:40:01,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807315214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1294959269] [2022-11-25 23:40:01,333 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:40:01,333 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:01,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:01,334 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:01,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:05,042 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:40:05,048 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:06,888 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6163#(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 [2022-11-25 23:40:06,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:06,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:40:06,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-11-25 23:40:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392830858] [2022-11-25 23:40:06,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:06,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:40:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:40:06,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:40:06,891 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2022-11-25 23:40:15,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:40:17,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:40:20,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:40:22,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:40:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:30,418 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2022-11-25 23:40:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:40:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 99 [2022-11-25 23:40:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:30,420 INFO L225 Difference]: With dead ends: 177 [2022-11-25 23:40:30,421 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 23:40:30,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:40:30,422 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 83 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:30,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 108 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 705 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2022-11-25 23:40:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 23:40:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2022-11-25 23:40:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 92 states have internal predecessors, (94), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-25 23:40:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2022-11-25 23:40:30,500 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 99 [2022-11-25 23:40:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:30,501 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2022-11-25 23:40:30,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2022-11-25 23:40:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2022-11-25 23:40:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 23:40:30,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:30,504 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:30,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:30,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:40:30,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2067588009, now seen corresponding path program 2 times [2022-11-25 23:40:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:30,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535640113] [2022-11-25 23:40:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:30,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:40:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541647355] [2022-11-25 23:40:30,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:40:30,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:30,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:30,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:40:30,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-25 23:40:30,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:40:30,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:40:30,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-25 23:40:31,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-11-25 23:40:31,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:31,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535640113] [2022-11-25 23:40:31,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:40:31,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541647355] [2022-11-25 23:40:31,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541647355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1958446142] [2022-11-25 23:40:31,239 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:40:31,240 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:31,240 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:31,240 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:31,240 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:34,014 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:40:34,018 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:40:41,107 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7435#(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 [2022-11-25 23:40:41,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:40:41,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:40:41,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-25 23:40:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379562079] [2022-11-25 23:40:41,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:40:41,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:40:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:40:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:40:41,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:40:41,110 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-11-25 23:40:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:40:41,792 INFO L93 Difference]: Finished difference Result 352 states and 366 transitions. [2022-11-25 23:40:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 23:40:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 124 [2022-11-25 23:40:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:40:41,795 INFO L225 Difference]: With dead ends: 352 [2022-11-25 23:40:41,795 INFO L226 Difference]: Without dead ends: 331 [2022-11-25 23:40:41,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:40:41,797 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:40:41,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 253 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:40:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-25 23:40:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 309. [2022-11-25 23:40:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 195 states have (on average 1.0307692307692307) internal successors, (201), 199 states have internal predecessors, (201), 60 states have call successors, (60), 54 states have call predecessors, (60), 53 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2022-11-25 23:40:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 319 transitions. [2022-11-25 23:40:41,905 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 319 transitions. Word has length 124 [2022-11-25 23:40:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:40:41,906 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 319 transitions. [2022-11-25 23:40:41,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-11-25 23:40:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 319 transitions. [2022-11-25 23:40:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-25 23:40:41,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:40:41,913 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 37, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:40:41,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:40:42,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:42,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:40:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:40:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 426484197, now seen corresponding path program 3 times [2022-11-25 23:40:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:40:42,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553094487] [2022-11-25 23:40:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:40:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:40:42,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:40:42,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587104830] [2022-11-25 23:40:42,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:40:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:40:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:40:42,136 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:40:42,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:40:44,621 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:40:44,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:40:44,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-25 23:40:44,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:40:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 613 proven. 562 refuted. 0 times theorem prover too weak. 1731 trivial. 0 not checked. [2022-11-25 23:40:45,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:40:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 404 proven. 24 refuted. 0 times theorem prover too weak. 2478 trivial. 0 not checked. [2022-11-25 23:40:49,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:40:49,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553094487] [2022-11-25 23:40:49,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:40:49,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587104830] [2022-11-25 23:40:49,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587104830] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:40:49,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1684408399] [2022-11-25 23:40:49,423 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:40:49,423 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:40:49,424 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:40:49,424 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:40:49,424 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:40:52,297 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-25 23:40:52,336 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:05,836 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9678#(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 [2022-11-25 23:41:05,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:05,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:41:05,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 25 [2022-11-25 23:41:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226512315] [2022-11-25 23:41:05,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:05,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 23:41:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:05,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 23:41:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 23:41:05,840 INFO L87 Difference]: Start difference. First operand 309 states and 319 transitions. Second operand has 25 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 18 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 16 states have call predecessors, (46), 18 states have call successors, (46) [2022-11-25 23:41:08,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:41:10,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 23:41:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:11,586 INFO L93 Difference]: Finished difference Result 316 states and 325 transitions. [2022-11-25 23:41:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:41:11,587 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 18 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 16 states have call predecessors, (46), 18 states have call successors, (46) Word has length 211 [2022-11-25 23:41:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:11,589 INFO L225 Difference]: With dead ends: 316 [2022-11-25 23:41:11,589 INFO L226 Difference]: Without dead ends: 289 [2022-11-25 23:41:11,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 592 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=303, Invalid=1589, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 23:41:11,591 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:11,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 68 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-25 23:41:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-25 23:41:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-11-25 23:41:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 186 states have (on average 1.0053763440860215) internal successors, (187), 186 states have internal predecessors, (187), 52 states have call successors, (52), 51 states have call predecessors, (52), 50 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-25 23:41:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2022-11-25 23:41:11,676 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 211 [2022-11-25 23:41:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:11,677 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2022-11-25 23:41:11,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 18 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 16 states have call predecessors, (46), 18 states have call successors, (46) [2022-11-25 23:41:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2022-11-25 23:41:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-25 23:41:11,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:11,683 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:11,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:11,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:11,891 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1818744179, now seen corresponding path program 3 times [2022-11-25 23:41:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:11,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330438451] [2022-11-25 23:41:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:11,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:41:11,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995792448] [2022-11-25 23:41:11,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:41:11,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:11,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:11,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:41:12,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:41:12,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:41:12,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 23:41:12,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-11-25 23:41:12,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-11-25 23:41:12,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330438451] [2022-11-25 23:41:12,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:41:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995792448] [2022-11-25 23:41:12,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995792448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:12,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [843908343] [2022-11-25 23:41:12,943 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:41:12,944 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:41:12,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:41:12,944 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:41:12,944 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:41:15,543 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:41:15,547 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:20,460 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12320#(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 [2022-11-25 23:41:20,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:20,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:41:20,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-25 23:41:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689126219] [2022-11-25 23:41:20,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:41:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:41:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:41:20,465 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-11-25 23:41:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:21,848 INFO L93 Difference]: Finished difference Result 635 states and 647 transitions. [2022-11-25 23:41:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 23:41:21,849 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) Word has length 292 [2022-11-25 23:41:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:21,856 INFO L225 Difference]: With dead ends: 635 [2022-11-25 23:41:21,857 INFO L226 Difference]: Without dead ends: 625 [2022-11-25 23:41:21,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=864, Invalid=2796, Unknown=0, NotChecked=0, Total=3660 [2022-11-25 23:41:21,861 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:21,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 510 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:41:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-25 23:41:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2022-11-25 23:41:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 402 states have (on average 1.0024875621890548) internal successors, (403), 402 states have internal predecessors, (403), 112 states have call successors, (112), 111 states have call predecessors, (112), 110 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-11-25 23:41:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2022-11-25 23:41:22,125 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 292 [2022-11-25 23:41:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:22,126 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2022-11-25 23:41:22,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-11-25 23:41:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2022-11-25 23:41:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2022-11-25 23:41:22,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:22,133 INFO L195 NwaCegarLoop]: trace histogram [112, 111, 111, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:22,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:22,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:41:22,340 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1500193707, now seen corresponding path program 4 times [2022-11-25 23:41:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:22,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528912978] [2022-11-25 23:41:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:22,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:41:22,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96496680] [2022-11-25 23:41:22,368 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:41:22,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:22,369 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:22,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:41:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:22,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 23:41:22,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-11-25 23:41:23,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-11-25 23:41:25,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:25,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528912978] [2022-11-25 23:41:25,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:41:25,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96496680] [2022-11-25 23:41:25,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96496680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:25,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2111123468] [2022-11-25 23:41:25,160 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:41:25,160 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:41:25,161 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:41:25,161 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:41:25,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:41:27,743 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:41:27,747 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:31,064 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17944#(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 [2022-11-25 23:41:31,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:31,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:41:31,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-25 23:41:31,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996263524] [2022-11-25 23:41:31,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:31,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 23:41:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 23:41:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=2831, Unknown=0, NotChecked=0, Total=4032 [2022-11-25 23:41:31,071 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand has 50 states, 50 states have (on average 4.24) internal successors, (212), 50 states have internal predecessors, (212), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-11-25 23:41:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:34,707 INFO L93 Difference]: Finished difference Result 1307 states and 1331 transitions. [2022-11-25 23:41:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-25 23:41:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.24) internal successors, (212), 50 states have internal predecessors, (212), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) Word has length 628 [2022-11-25 23:41:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:34,713 INFO L225 Difference]: With dead ends: 1307 [2022-11-25 23:41:34,714 INFO L226 Difference]: Without dead ends: 1297 [2022-11-25 23:41:34,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1927 GetRequests, 1820 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3384, Invalid=8388, Unknown=0, NotChecked=0, Total=11772 [2022-11-25 23:41:34,718 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 299 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:34,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 733 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-25 23:41:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-11-25 23:41:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2022-11-25 23:41:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 834 states have (on average 1.001199040767386) internal successors, (835), 834 states have internal predecessors, (835), 232 states have call successors, (232), 231 states have call predecessors, (232), 230 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2022-11-25 23:41:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1298 transitions. [2022-11-25 23:41:35,061 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1298 transitions. Word has length 628 [2022-11-25 23:41:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:35,063 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1298 transitions. [2022-11-25 23:41:35,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.24) internal successors, (212), 50 states have internal predecessors, (212), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-11-25 23:41:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1298 transitions. [2022-11-25 23:41:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2022-11-25 23:41:35,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:35,081 INFO L195 NwaCegarLoop]: trace histogram [232, 231, 231, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:35,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:41:35,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:41:35,293 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:41:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash 622252005, now seen corresponding path program 5 times [2022-11-25 23:41:35,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:35,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566016172] [2022-11-25 23:41:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:35,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:35,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:41:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121142670] [2022-11-25 23:41:35,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:41:35,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:41:35,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:35,347 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:41:35,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:41:37,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 162 check-sat command(s) [2022-11-25 23:41:37,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:41:37,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 23:41:37,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:41:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-11-25 23:41:40,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:41:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-11-25 23:41:44,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566016172] [2022-11-25 23:41:44,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:41:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121142670] [2022-11-25 23:41:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121142670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:41:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1320866328] [2022-11-25 23:41:44,431 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:41:44,431 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:41:44,432 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:41:44,432 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:41:44,432 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:41:47,103 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:41:47,108 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:41:52,705 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '29568#(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 [2022-11-25 23:41:52,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:41:52,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:41:52,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-25 23:41:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174984905] [2022-11-25 23:41:52,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:41:52,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-25 23:41:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-25 23:41:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4633, Invalid=7799, Unknown=0, NotChecked=0, Total=12432 [2022-11-25 23:41:52,717 INFO L87 Difference]: Start difference. First operand 1297 states and 1298 transitions. Second operand has 98 states, 98 states have (on average 4.36734693877551) internal successors, (428), 98 states have internal predecessors, (428), 93 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 93 states have call predecessors, (462), 93 states have call successors, (462) [2022-11-25 23:42:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:03,906 INFO L93 Difference]: Finished difference Result 2651 states and 2699 transitions. [2022-11-25 23:42:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-25 23:42:03,908 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.36734693877551) internal successors, (428), 98 states have internal predecessors, (428), 93 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 93 states have call predecessors, (462), 93 states have call successors, (462) Word has length 1300 [2022-11-25 23:42:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:03,921 INFO L225 Difference]: With dead ends: 2651 [2022-11-25 23:42:03,922 INFO L226 Difference]: Without dead ends: 2641 [2022-11-25 23:42:03,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3991 GetRequests, 3788 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8283 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=13608, Invalid=28212, Unknown=0, NotChecked=0, Total=41820 [2022-11-25 23:42:03,931 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 590 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:03,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1933 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-25 23:42:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2022-11-25 23:42:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2641. [2022-11-25 23:42:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 1698 states have (on average 1.0005889281507656) internal successors, (1699), 1698 states have internal predecessors, (1699), 472 states have call successors, (472), 471 states have call predecessors, (472), 470 states have return successors, (471), 471 states have call predecessors, (471), 471 states have call successors, (471) [2022-11-25 23:42:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 2642 transitions. [2022-11-25 23:42:04,923 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 2642 transitions. Word has length 1300 [2022-11-25 23:42:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:04,926 INFO L495 AbstractCegarLoop]: Abstraction has 2641 states and 2642 transitions. [2022-11-25 23:42:04,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.36734693877551) internal successors, (428), 98 states have internal predecessors, (428), 93 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 93 states have call predecessors, (462), 93 states have call successors, (462) [2022-11-25 23:42:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 2642 transitions. [2022-11-25 23:42:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2645 [2022-11-25 23:42:04,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:04,990 INFO L195 NwaCegarLoop]: trace histogram [472, 471, 471, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:05,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:05,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:05,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:42:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1606219525, now seen corresponding path program 6 times [2022-11-25 23:42:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:05,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620933372] [2022-11-25 23:42:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:05,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:42:05,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661813479] [2022-11-25 23:42:05,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:42:05,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:05,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:05,306 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:05,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 23:42:07,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:42:07,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:07,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 5606 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-25 23:42:07,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 478838 backedges. 2820 proven. 472256 refuted. 0 times theorem prover too weak. 3762 trivial. 0 not checked. [2022-11-25 23:42:15,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 478838 backedges. 942 proven. 35156 refuted. 0 times theorem prover too weak. 442740 trivial. 0 not checked. [2022-11-25 23:42:21,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:21,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620933372] [2022-11-25 23:42:21,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:42:21,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661813479] [2022-11-25 23:42:21,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661813479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:21,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2062713358] [2022-11-25 23:42:21,930 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-25 23:42:21,930 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:21,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:21,931 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:21,931 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:25,153 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-25 23:42:25,157 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:27,217 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '53102#(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 [2022-11-25 23:42:27,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:42:27,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:42:27,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-25 23:42:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417450034] [2022-11-25 23:42:27,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:27,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-25 23:42:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:27,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-25 23:42:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5224, Invalid=8582, Unknown=0, NotChecked=0, Total=13806 [2022-11-25 23:42:27,233 INFO L87 Difference]: Start difference. First operand 2641 states and 2642 transitions. Second operand has 104 states, 104 states have (on average 5.701923076923077) internal successors, (593), 104 states have internal predecessors, (593), 100 states have call successors, (943), 96 states have call predecessors, (943), 96 states have return successors, (942), 100 states have call predecessors, (942), 100 states have call successors, (942) [2022-11-25 23:42:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:36,742 INFO L93 Difference]: Finished difference Result 2819 states and 2825 transitions. [2022-11-25 23:42:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-25 23:42:36,744 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.701923076923077) internal successors, (593), 104 states have internal predecessors, (593), 100 states have call successors, (943), 96 states have call predecessors, (943), 96 states have return successors, (942), 100 states have call predecessors, (942), 100 states have call successors, (942) Word has length 2644 [2022-11-25 23:42:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:36,758 INFO L225 Difference]: With dead ends: 2819 [2022-11-25 23:42:36,759 INFO L226 Difference]: Without dead ends: 2809 [2022-11-25 23:42:36,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8029 GetRequests, 7724 SyntacticMatches, 90 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12098 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=15417, Invalid=31455, Unknown=0, NotChecked=0, Total=46872 [2022-11-25 23:42:36,767 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 49 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:36,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1478 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-25 23:42:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-11-25 23:42:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2022-11-25 23:42:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 1806 states have (on average 1.0005537098560355) internal successors, (1807), 1806 states have internal predecessors, (1807), 502 states have call successors, (502), 501 states have call predecessors, (502), 500 states have return successors, (501), 501 states have call predecessors, (501), 501 states have call successors, (501) [2022-11-25 23:42:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 2810 transitions. [2022-11-25 23:42:37,746 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 2810 transitions. Word has length 2644 [2022-11-25 23:42:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:37,748 INFO L495 AbstractCegarLoop]: Abstraction has 2809 states and 2810 transitions. [2022-11-25 23:42:37,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.701923076923077) internal successors, (593), 104 states have internal predecessors, (593), 100 states have call successors, (943), 96 states have call predecessors, (943), 96 states have return successors, (942), 100 states have call predecessors, (942), 100 states have call successors, (942) [2022-11-25 23:42:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 2810 transitions. [2022-11-25 23:42:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2813 [2022-11-25 23:42:37,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:37,820 INFO L195 NwaCegarLoop]: trace histogram [502, 501, 501, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:37,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:38,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:42:38,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:42:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -301534743, now seen corresponding path program 7 times [2022-11-25 23:42:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121801501] [2022-11-25 23:42:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:38,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:42:38,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168205112] [2022-11-25 23:42:38,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:42:38,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:38,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:38,110 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:38,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 23:42:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:42:39,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:42:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:42:41,749 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:42:41,749 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:42:41,750 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 23:42:41,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:41,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:41,982 INFO L445 BasicCegarLoop]: Path program histogram: [7, 4, 3, 1, 1, 1, 1, 1] [2022-11-25 23:42:41,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:42:42,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:42:42 BoogieIcfgContainer [2022-11-25 23:42:42,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:42:42,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:42:42,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:42:42,423 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:42:42,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:38:51" (3/4) ... [2022-11-25 23:42:42,426 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 23:42:43,011 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:42:43,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:42:43,012 INFO L158 Benchmark]: Toolchain (without parser) took 232295.95ms. Allocated memory was 144.7MB in the beginning and 1.1GB in the end (delta: 996.1MB). Free memory was 101.8MB in the beginning and 547.4MB in the end (delta: -445.6MB). Peak memory consumption was 551.5MB. Max. memory is 16.1GB. [2022-11-25 23:42:43,013 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 144.7MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:42:43,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.47ms. Allocated memory is still 144.7MB. Free memory was 101.8MB in the beginning and 91.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 23:42:43,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.10ms. Allocated memory is still 144.7MB. Free memory was 90.7MB in the beginning and 89.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:42:43,018 INFO L158 Benchmark]: Boogie Preprocessor took 45.08ms. Allocated memory is still 144.7MB. Free memory was 89.2MB in the beginning and 88.3MB in the end (delta: 966.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:42:43,020 INFO L158 Benchmark]: RCFGBuilder took 454.19ms. Allocated memory is still 144.7MB. Free memory was 88.3MB in the beginning and 76.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:42:43,021 INFO L158 Benchmark]: TraceAbstraction took 230799.19ms. Allocated memory was 144.7MB in the beginning and 1.1GB in the end (delta: 996.1MB). Free memory was 75.3MB in the beginning and 626.8MB in the end (delta: -551.5MB). Peak memory consumption was 446.6MB. Max. memory is 16.1GB. [2022-11-25 23:42:43,021 INFO L158 Benchmark]: Witness Printer took 589.09ms. Allocated memory is still 1.1GB. Free memory was 626.8MB in the beginning and 547.4MB in the end (delta: 79.4MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-11-25 23:42:43,027 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.33ms. Allocated memory is still 144.7MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.47ms. Allocated memory is still 144.7MB. Free memory was 101.8MB in the beginning and 91.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.10ms. Allocated memory is still 144.7MB. Free memory was 90.7MB in the beginning and 89.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.08ms. Allocated memory is still 144.7MB. Free memory was 89.2MB in the beginning and 88.3MB in the end (delta: 966.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.19ms. Allocated memory is still 144.7MB. Free memory was 88.3MB in the beginning and 76.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 230799.19ms. Allocated memory was 144.7MB in the beginning and 1.1GB in the end (delta: 996.1MB). Free memory was 75.3MB in the beginning and 626.8MB in the end (delta: -551.5MB). Peak memory consumption was 446.6MB. Max. memory is 16.1GB. * Witness Printer took 589.09ms. Allocated memory is still 1.1GB. Free memory was 626.8MB in the beginning and 547.4MB in the end (delta: 79.4MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=100, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=100, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=100, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=100, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=100, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=100, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=100, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=100, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=100, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=100, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=100, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=100, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=100, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=100, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=100, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=100, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=100, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=100, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=100, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=100, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=100, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=100, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=21, n=20, x=8000, y=1261, z=126] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=21, n=20, x=8000, y=1261, z=126] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=21, n=20, x=8000, y=1261, z=126] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=21, n=20, x=8000, y=1261, z=126] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [a=100, counter=22, counter++=21, n=21, x=9261, y=1387, z=132] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=22, n=21, x=9261, y=1387, z=132] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=22, n=21, x=9261, y=1387, z=132] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=22, n=21, x=9261, y=1387, z=132] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=22, n=21, x=9261, y=1387, z=132] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [a=100, counter=23, counter++=22, n=22, x=10648, y=1519, z=138] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=23, n=22, x=10648, y=1519, z=138] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=23, n=22, x=10648, y=1519, z=138] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=23, n=22, x=10648, y=1519, z=138] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=23, n=22, x=10648, y=1519, z=138] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [a=100, counter=24, counter++=23, n=23, x=12167, y=1657, z=144] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=24, n=23, x=12167, y=1657, z=144] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=24, n=23, x=12167, y=1657, z=144] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=24, n=23, x=12167, y=1657, z=144] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=24, n=23, x=12167, y=1657, z=144] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [a=100, counter=25, counter++=24, n=24, x=13824, y=1801, z=150] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=25, n=24, x=13824, y=1801, z=150] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=25, n=24, x=13824, y=1801, z=150] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=25, n=24, x=13824, y=1801, z=150] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=25, n=24, x=13824, y=1801, z=150] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [a=100, counter=26, counter++=25, n=25, x=15625, y=1951, z=156] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=26, n=25, x=15625, y=1951, z=156] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=26, n=25, x=15625, y=1951, z=156] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=26, n=25, x=15625, y=1951, z=156] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=26, n=25, x=15625, y=1951, z=156] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [a=100, counter=27, counter++=26, n=26, x=17576, y=2107, z=162] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=27, n=26, x=17576, y=2107, z=162] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=27, n=26, x=17576, y=2107, z=162] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=27, n=26, x=17576, y=2107, z=162] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=27, n=26, x=17576, y=2107, z=162] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [a=100, counter=28, counter++=27, n=27, x=19683, y=2269, z=168] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=28, n=27, x=19683, y=2269, z=168] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=28, n=27, x=19683, y=2269, z=168] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=28, n=27, x=19683, y=2269, z=168] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=28, n=27, x=19683, y=2269, z=168] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [a=100, counter=29, counter++=28, n=28, x=21952, y=2437, z=174] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=29, n=28, x=21952, y=2437, z=174] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=29, n=28, x=21952, y=2437, z=174] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=29, n=28, x=21952, y=2437, z=174] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=29, n=28, x=21952, y=2437, z=174] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [a=100, counter=30, counter++=29, n=29, x=24389, y=2611, z=180] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=30, n=29, x=24389, y=2611, z=180] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=30, n=29, x=24389, y=2611, z=180] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=30, n=29, x=24389, y=2611, z=180] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=30, n=29, x=24389, y=2611, z=180] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [a=100, counter=31, counter++=30, n=30, x=27000, y=2791, z=186] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=31, n=30, x=27000, y=2791, z=186] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=31, n=30, x=27000, y=2791, z=186] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=31, n=30, x=27000, y=2791, z=186] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=31, n=30, x=27000, y=2791, z=186] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [a=100, counter=32, counter++=31, n=31, x=29791, y=2977, z=192] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=32, n=31, x=29791, y=2977, z=192] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=32, n=31, x=29791, y=2977, z=192] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=32, n=31, x=29791, y=2977, z=192] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=32, n=31, x=29791, y=2977, z=192] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [a=100, counter=33, counter++=32, n=32, x=32768, y=3169, z=198] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=33, n=32, x=32768, y=3169, z=198] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=33, n=32, x=32768, y=3169, z=198] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=33, n=32, x=32768, y=3169, z=198] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=33, n=32, x=32768, y=3169, z=198] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [a=100, counter=34, counter++=33, n=33, x=35937, y=3367, z=204] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=34, n=33, x=35937, y=3367, z=204] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=34, n=33, x=35937, y=3367, z=204] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=34, n=33, x=35937, y=3367, z=204] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=34, n=33, x=35937, y=3367, z=204] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [a=100, counter=35, counter++=34, n=34, x=39304, y=3571, z=210] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=35, n=34, x=39304, y=3571, z=210] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=35, n=34, x=39304, y=3571, z=210] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=35, n=34, x=39304, y=3571, z=210] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=35, n=34, x=39304, y=3571, z=210] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [a=100, counter=36, counter++=35, n=35, x=42875, y=3781, z=216] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=36, n=35, x=42875, y=3781, z=216] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=36, n=35, x=42875, y=3781, z=216] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=36, n=35, x=42875, y=3781, z=216] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=36, n=35, x=42875, y=3781, z=216] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [a=100, counter=37, counter++=36, n=36, x=46656, y=3997, z=222] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=37, n=36, x=46656, y=3997, z=222] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=37, n=36, x=46656, y=3997, z=222] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=37, n=36, x=46656, y=3997, z=222] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=37, n=36, x=46656, y=3997, z=222] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [a=100, counter=38, counter++=37, n=37, x=50653, y=4219, z=228] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=38, n=37, x=50653, y=4219, z=228] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=38, n=37, x=50653, y=4219, z=228] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=38, n=37, x=50653, y=4219, z=228] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=38, n=37, x=50653, y=4219, z=228] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [a=100, counter=39, counter++=38, n=38, x=54872, y=4447, z=234] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=39, n=38, x=54872, y=4447, z=234] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=39, n=38, x=54872, y=4447, z=234] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=39, n=38, x=54872, y=4447, z=234] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=39, n=38, x=54872, y=4447, z=234] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [a=100, counter=40, counter++=39, n=39, x=59319, y=4681, z=240] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=40, n=39, x=59319, y=4681, z=240] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=40, n=39, x=59319, y=4681, z=240] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=40, n=39, x=59319, y=4681, z=240] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=40, n=39, x=59319, y=4681, z=240] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [a=100, counter=41, counter++=40, n=40, x=64000, y=4921, z=246] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=41, n=40, x=64000, y=4921, z=246] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=41, n=40, x=64000, y=4921, z=246] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=41, n=40, x=64000, y=4921, z=246] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=41, n=40, x=64000, y=4921, z=246] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [a=100, counter=42, counter++=41, n=41, x=68921, y=5167, z=252] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=42, n=41, x=68921, y=5167, z=252] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=42, n=41, x=68921, y=5167, z=252] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=42, n=41, x=68921, y=5167, z=252] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=42, n=41, x=68921, y=5167, z=252] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [a=100, counter=43, counter++=42, n=42, x=74088, y=5419, z=258] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=43, n=42, x=74088, y=5419, z=258] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=43, n=42, x=74088, y=5419, z=258] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=43, n=42, x=74088, y=5419, z=258] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=43, n=42, x=74088, y=5419, z=258] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [a=100, counter=44, counter++=43, n=43, x=79507, y=5677, z=264] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=44, n=43, x=79507, y=5677, z=264] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=44, n=43, x=79507, y=5677, z=264] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=44, n=43, x=79507, y=5677, z=264] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=44, n=43, x=79507, y=5677, z=264] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [a=100, counter=45, counter++=44, n=44, x=85184, y=5941, z=270] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=45, n=44, x=85184, y=5941, z=270] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=45, n=44, x=85184, y=5941, z=270] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=45, n=44, x=85184, y=5941, z=270] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=45, n=44, x=85184, y=5941, z=270] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [a=100, counter=46, counter++=45, n=45, x=91125, y=6211, z=276] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=46, n=45, x=91125, y=6211, z=276] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=46, n=45, x=91125, y=6211, z=276] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=46, n=45, x=91125, y=6211, z=276] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=46, n=45, x=91125, y=6211, z=276] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [a=100, counter=47, counter++=46, n=46, x=97336, y=6487, z=282] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=47, n=46, x=97336, y=6487, z=282] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=47, n=46, x=97336, y=6487, z=282] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=47, n=46, x=97336, y=6487, z=282] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=47, n=46, x=97336, y=6487, z=282] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [a=100, counter=48, counter++=47, n=47, x=103823, y=6769, z=288] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=48, n=47, x=103823, y=6769, z=288] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=48, n=47, x=103823, y=6769, z=288] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=48, n=47, x=103823, y=6769, z=288] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=48, n=47, x=103823, y=6769, z=288] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [a=100, counter=49, counter++=48, n=48, x=110592, y=7057, z=294] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=49, n=48, x=110592, y=7057, z=294] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=49, n=48, x=110592, y=7057, z=294] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=49, n=48, x=110592, y=7057, z=294] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=49, n=48, x=110592, y=7057, z=294] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [a=100, counter=50, counter++=49, n=49, x=117649, y=7351, z=300] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=50, n=49, x=117649, y=7351, z=300] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=50, n=49, x=117649, y=7351, z=300] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=50, n=49, x=117649, y=7351, z=300] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=50, n=49, x=117649, y=7351, z=300] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [a=100, counter=51, counter++=50, n=50, x=125000, y=7651, z=306] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=51, n=50, x=125000, y=7651, z=306] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=51, n=50, x=125000, y=7651, z=306] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=51, n=50, x=125000, y=7651, z=306] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=51, n=50, x=125000, y=7651, z=306] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=51, n=50, x=125000, y=7651, z=306] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=51, n=51, x=132651, y=7957, z=312] [L33] EXPR counter++ VAL [a=100, counter=52, counter++=51, n=51, x=132651, y=7957, z=312] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=52, n=51, x=132651, y=7957, z=312] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=52, n=51, x=132651, y=7957, z=312] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=52, n=51, x=132651, y=7957, z=312] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=52, n=51, x=132651, y=7957, z=312] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=52] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=52, n=51, x=132651, y=7957, z=312] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=52, n=52, x=140608, y=8269, z=318] [L33] EXPR counter++ VAL [a=100, counter=53, counter++=52, n=52, x=140608, y=8269, z=318] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=53, n=52, x=140608, y=8269, z=318] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=53, n=52, x=140608, y=8269, z=318] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=53, n=52, x=140608, y=8269, z=318] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=53, n=52, x=140608, y=8269, z=318] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=53] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=53, n=52, x=140608, y=8269, z=318] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=53, n=53, x=148877, y=8587, z=324] [L33] EXPR counter++ VAL [a=100, counter=54, counter++=53, n=53, x=148877, y=8587, z=324] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=54, n=53, x=148877, y=8587, z=324] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=54, n=53, x=148877, y=8587, z=324] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=54, n=53, x=148877, y=8587, z=324] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=54, n=53, x=148877, y=8587, z=324] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=54] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=54, n=53, x=148877, y=8587, z=324] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=54, n=54, x=157464, y=8911, z=330] [L33] EXPR counter++ VAL [a=100, counter=55, counter++=54, n=54, x=157464, y=8911, z=330] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=55, n=54, x=157464, y=8911, z=330] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=55, n=54, x=157464, y=8911, z=330] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=55, n=54, x=157464, y=8911, z=330] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=55, n=54, x=157464, y=8911, z=330] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=55] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=55, n=54, x=157464, y=8911, z=330] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=55, n=55, x=166375, y=9241, z=336] [L33] EXPR counter++ VAL [a=100, counter=56, counter++=55, n=55, x=166375, y=9241, z=336] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=56, n=55, x=166375, y=9241, z=336] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=56, n=55, x=166375, y=9241, z=336] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=56, n=55, x=166375, y=9241, z=336] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=56, n=55, x=166375, y=9241, z=336] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=56] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=56, n=55, x=166375, y=9241, z=336] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=56, n=56, x=175616, y=9577, z=342] [L33] EXPR counter++ VAL [a=100, counter=57, counter++=56, n=56, x=175616, y=9577, z=342] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=57, n=56, x=175616, y=9577, z=342] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=57, n=56, x=175616, y=9577, z=342] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=57, n=56, x=175616, y=9577, z=342] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=57, n=56, x=175616, y=9577, z=342] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=57] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=57, n=56, x=175616, y=9577, z=342] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=57, n=57, x=185193, y=9919, z=348] [L33] EXPR counter++ VAL [a=100, counter=58, counter++=57, n=57, x=185193, y=9919, z=348] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=58, n=57, x=185193, y=9919, z=348] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=58, n=57, x=185193, y=9919, z=348] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=58, n=57, x=185193, y=9919, z=348] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=58, n=57, x=185193, y=9919, z=348] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=58] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=58, n=57, x=185193, y=9919, z=348] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=58, n=58, x=195112, y=10267, z=354] [L33] EXPR counter++ VAL [a=100, counter=59, counter++=58, n=58, x=195112, y=10267, z=354] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=59, n=58, x=195112, y=10267, z=354] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=59, n=58, x=195112, y=10267, z=354] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=59, n=58, x=195112, y=10267, z=354] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=59, n=58, x=195112, y=10267, z=354] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=59] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=59, n=58, x=195112, y=10267, z=354] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=59, n=59, x=205379, y=10621, z=360] [L33] EXPR counter++ VAL [a=100, counter=60, counter++=59, n=59, x=205379, y=10621, z=360] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=60, n=59, x=205379, y=10621, z=360] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=60, n=59, x=205379, y=10621, z=360] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=60, n=59, x=205379, y=10621, z=360] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=60, n=59, x=205379, y=10621, z=360] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=60] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=60, n=59, x=205379, y=10621, z=360] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=60, n=60, x=216000, y=10981, z=366] [L33] EXPR counter++ VAL [a=100, counter=61, counter++=60, n=60, x=216000, y=10981, z=366] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=61, n=60, x=216000, y=10981, z=366] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=61, n=60, x=216000, y=10981, z=366] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=61, n=60, x=216000, y=10981, z=366] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=61, n=60, x=216000, y=10981, z=366] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=61] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=61, n=60, x=216000, y=10981, z=366] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=61, n=61, x=226981, y=11347, z=372] [L33] EXPR counter++ VAL [a=100, counter=62, counter++=61, n=61, x=226981, y=11347, z=372] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=62, n=61, x=226981, y=11347, z=372] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=62, n=61, x=226981, y=11347, z=372] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=62, n=61, x=226981, y=11347, z=372] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=62, n=61, x=226981, y=11347, z=372] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=62] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=62, n=61, x=226981, y=11347, z=372] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=62, n=62, x=238328, y=11719, z=378] [L33] EXPR counter++ VAL [a=100, counter=63, counter++=62, n=62, x=238328, y=11719, z=378] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=63, n=62, x=238328, y=11719, z=378] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=63, n=62, x=238328, y=11719, z=378] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=63, n=62, x=238328, y=11719, z=378] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=63, n=62, x=238328, y=11719, z=378] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=63] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=63, n=62, x=238328, y=11719, z=378] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=63, n=63, x=250047, y=12097, z=384] [L33] EXPR counter++ VAL [a=100, counter=64, counter++=63, n=63, x=250047, y=12097, z=384] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=64, n=63, x=250047, y=12097, z=384] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=64, n=63, x=250047, y=12097, z=384] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=64, n=63, x=250047, y=12097, z=384] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=64, n=63, x=250047, y=12097, z=384] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=64] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=64, n=63, x=250047, y=12097, z=384] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=64, n=64, x=262144, y=12481, z=390] [L33] EXPR counter++ VAL [a=100, counter=65, counter++=64, n=64, x=262144, y=12481, z=390] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=65, n=64, x=262144, y=12481, z=390] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=65, n=64, x=262144, y=12481, z=390] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=65, n=64, x=262144, y=12481, z=390] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=65, n=64, x=262144, y=12481, z=390] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=65] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=65, n=64, x=262144, y=12481, z=390] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=65, n=65, x=274625, y=12871, z=396] [L33] EXPR counter++ VAL [a=100, counter=66, counter++=65, n=65, x=274625, y=12871, z=396] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=66, n=65, x=274625, y=12871, z=396] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=66, n=65, x=274625, y=12871, z=396] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=66, n=65, x=274625, y=12871, z=396] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=66, n=65, x=274625, y=12871, z=396] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=66] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=66, n=65, x=274625, y=12871, z=396] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=66, n=66, x=287496, y=13267, z=402] [L33] EXPR counter++ VAL [a=100, counter=67, counter++=66, n=66, x=287496, y=13267, z=402] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=67, n=66, x=287496, y=13267, z=402] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=67, n=66, x=287496, y=13267, z=402] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=67, n=66, x=287496, y=13267, z=402] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=67, n=66, x=287496, y=13267, z=402] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=67] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=67, n=66, x=287496, y=13267, z=402] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=67, n=67, x=300763, y=13669, z=408] [L33] EXPR counter++ VAL [a=100, counter=68, counter++=67, n=67, x=300763, y=13669, z=408] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=68, n=67, x=300763, y=13669, z=408] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=68, n=67, x=300763, y=13669, z=408] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=68, n=67, x=300763, y=13669, z=408] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=68, n=67, x=300763, y=13669, z=408] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=68] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=68, n=67, x=300763, y=13669, z=408] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=68, n=68, x=314432, y=14077, z=414] [L33] EXPR counter++ VAL [a=100, counter=69, counter++=68, n=68, x=314432, y=14077, z=414] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=69, n=68, x=314432, y=14077, z=414] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=69, n=68, x=314432, y=14077, z=414] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=69, n=68, x=314432, y=14077, z=414] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=69, n=68, x=314432, y=14077, z=414] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=69] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=69, n=68, x=314432, y=14077, z=414] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=69, n=69, x=328509, y=14491, z=420] [L33] EXPR counter++ VAL [a=100, counter=70, counter++=69, n=69, x=328509, y=14491, z=420] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=70, n=69, x=328509, y=14491, z=420] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=70, n=69, x=328509, y=14491, z=420] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=70, n=69, x=328509, y=14491, z=420] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=70, n=69, x=328509, y=14491, z=420] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=70] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=70, n=69, x=328509, y=14491, z=420] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=70, n=70, x=343000, y=14911, z=426] [L33] EXPR counter++ VAL [a=100, counter=71, counter++=70, n=70, x=343000, y=14911, z=426] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=71, n=70, x=343000, y=14911, z=426] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=71, n=70, x=343000, y=14911, z=426] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=71, n=70, x=343000, y=14911, z=426] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=71, n=70, x=343000, y=14911, z=426] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=71] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=71, n=70, x=343000, y=14911, z=426] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=71, n=71, x=357911, y=15337, z=432] [L33] EXPR counter++ VAL [a=100, counter=72, counter++=71, n=71, x=357911, y=15337, z=432] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=72, n=71, x=357911, y=15337, z=432] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=72, n=71, x=357911, y=15337, z=432] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=72, n=71, x=357911, y=15337, z=432] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=72, n=71, x=357911, y=15337, z=432] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=72] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=72, n=71, x=357911, y=15337, z=432] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=72, n=72, x=373248, y=15769, z=438] [L33] EXPR counter++ VAL [a=100, counter=73, counter++=72, n=72, x=373248, y=15769, z=438] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=73, n=72, x=373248, y=15769, z=438] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=73, n=72, x=373248, y=15769, z=438] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=73, n=72, x=373248, y=15769, z=438] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=73, n=72, x=373248, y=15769, z=438] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=73] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=73, n=72, x=373248, y=15769, z=438] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=73, n=73, x=389017, y=16207, z=444] [L33] EXPR counter++ VAL [a=100, counter=74, counter++=73, n=73, x=389017, y=16207, z=444] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=74, n=73, x=389017, y=16207, z=444] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=74, n=73, x=389017, y=16207, z=444] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=74, n=73, x=389017, y=16207, z=444] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=74, n=73, x=389017, y=16207, z=444] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=74] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=74, n=73, x=389017, y=16207, z=444] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=74, n=74, x=405224, y=16651, z=450] [L33] EXPR counter++ VAL [a=100, counter=75, counter++=74, n=74, x=405224, y=16651, z=450] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=75, n=74, x=405224, y=16651, z=450] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=75, n=74, x=405224, y=16651, z=450] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=75, n=74, x=405224, y=16651, z=450] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=75, n=74, x=405224, y=16651, z=450] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=75] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=75, n=74, x=405224, y=16651, z=450] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=75, n=75, x=421875, y=17101, z=456] [L33] EXPR counter++ VAL [a=100, counter=76, counter++=75, n=75, x=421875, y=17101, z=456] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=76, n=75, x=421875, y=17101, z=456] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=76, n=75, x=421875, y=17101, z=456] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=76, n=75, x=421875, y=17101, z=456] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=76, n=75, x=421875, y=17101, z=456] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=76] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=76, n=75, x=421875, y=17101, z=456] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=76, n=76, x=438976, y=17557, z=462] [L33] EXPR counter++ VAL [a=100, counter=77, counter++=76, n=76, x=438976, y=17557, z=462] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=77, n=76, x=438976, y=17557, z=462] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=77, n=76, x=438976, y=17557, z=462] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=77, n=76, x=438976, y=17557, z=462] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=77, n=76, x=438976, y=17557, z=462] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=77] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=77, n=76, x=438976, y=17557, z=462] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=77, n=77, x=456533, y=18019, z=468] [L33] EXPR counter++ VAL [a=100, counter=78, counter++=77, n=77, x=456533, y=18019, z=468] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=78, n=77, x=456533, y=18019, z=468] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=78, n=77, x=456533, y=18019, z=468] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=78, n=77, x=456533, y=18019, z=468] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=78, n=77, x=456533, y=18019, z=468] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=78] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=78, n=77, x=456533, y=18019, z=468] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=78, n=78, x=474552, y=18487, z=474] [L33] EXPR counter++ VAL [a=100, counter=79, counter++=78, n=78, x=474552, y=18487, z=474] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=79, n=78, x=474552, y=18487, z=474] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=79, n=78, x=474552, y=18487, z=474] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=79, n=78, x=474552, y=18487, z=474] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=79, n=78, x=474552, y=18487, z=474] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=79] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=79, n=78, x=474552, y=18487, z=474] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=79, n=79, x=493039, y=18961, z=480] [L33] EXPR counter++ VAL [a=100, counter=80, counter++=79, n=79, x=493039, y=18961, z=480] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=80, n=79, x=493039, y=18961, z=480] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=80, n=79, x=493039, y=18961, z=480] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=80, n=79, x=493039, y=18961, z=480] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=80, n=79, x=493039, y=18961, z=480] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=80] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=80, n=79, x=493039, y=18961, z=480] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=80, n=80, x=512000, y=19441, z=486] [L33] EXPR counter++ VAL [a=100, counter=81, counter++=80, n=80, x=512000, y=19441, z=486] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=81, n=80, x=512000, y=19441, z=486] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=81, n=80, x=512000, y=19441, z=486] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=81, n=80, x=512000, y=19441, z=486] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=81, n=80, x=512000, y=19441, z=486] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=81] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=81, n=80, x=512000, y=19441, z=486] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=81, n=81, x=531441, y=19927, z=492] [L33] EXPR counter++ VAL [a=100, counter=82, counter++=81, n=81, x=531441, y=19927, z=492] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=82, n=81, x=531441, y=19927, z=492] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=82, n=81, x=531441, y=19927, z=492] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=82, n=81, x=531441, y=19927, z=492] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=82, n=81, x=531441, y=19927, z=492] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=82] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=82, n=81, x=531441, y=19927, z=492] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=82, n=82, x=551368, y=20419, z=498] [L33] EXPR counter++ VAL [a=100, counter=83, counter++=82, n=82, x=551368, y=20419, z=498] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=83, n=82, x=551368, y=20419, z=498] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=83, n=82, x=551368, y=20419, z=498] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=83, n=82, x=551368, y=20419, z=498] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=83, n=82, x=551368, y=20419, z=498] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=83] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=83, n=82, x=551368, y=20419, z=498] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=83, n=83, x=571787, y=20917, z=504] [L33] EXPR counter++ VAL [a=100, counter=84, counter++=83, n=83, x=571787, y=20917, z=504] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=84, n=83, x=571787, y=20917, z=504] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=84, n=83, x=571787, y=20917, z=504] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=84, n=83, x=571787, y=20917, z=504] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=84, n=83, x=571787, y=20917, z=504] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=84] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=84, n=83, x=571787, y=20917, z=504] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=84, n=84, x=592704, y=21421, z=510] [L33] EXPR counter++ VAL [a=100, counter=85, counter++=84, n=84, x=592704, y=21421, z=510] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=85, n=84, x=592704, y=21421, z=510] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=85, n=84, x=592704, y=21421, z=510] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=85, n=84, x=592704, y=21421, z=510] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=85, n=84, x=592704, y=21421, z=510] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=85] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=85, n=84, x=592704, y=21421, z=510] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=85, n=85, x=614125, y=21931, z=516] [L33] EXPR counter++ VAL [a=100, counter=86, counter++=85, n=85, x=614125, y=21931, z=516] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=86, n=85, x=614125, y=21931, z=516] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=86, n=85, x=614125, y=21931, z=516] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=86, n=85, x=614125, y=21931, z=516] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=86, n=85, x=614125, y=21931, z=516] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=86] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=86, n=85, x=614125, y=21931, z=516] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=86, n=86, x=636056, y=22447, z=522] [L33] EXPR counter++ VAL [a=100, counter=87, counter++=86, n=86, x=636056, y=22447, z=522] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=87, n=86, x=636056, y=22447, z=522] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=87, n=86, x=636056, y=22447, z=522] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=87, n=86, x=636056, y=22447, z=522] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=87, n=86, x=636056, y=22447, z=522] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=87] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=87, n=86, x=636056, y=22447, z=522] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=87, n=87, x=658503, y=22969, z=528] [L33] EXPR counter++ VAL [a=100, counter=88, counter++=87, n=87, x=658503, y=22969, z=528] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=88, n=87, x=658503, y=22969, z=528] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=88, n=87, x=658503, y=22969, z=528] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=88, n=87, x=658503, y=22969, z=528] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=88, n=87, x=658503, y=22969, z=528] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=88] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=88, n=87, x=658503, y=22969, z=528] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=88, n=88, x=681472, y=23497, z=534] [L33] EXPR counter++ VAL [a=100, counter=89, counter++=88, n=88, x=681472, y=23497, z=534] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=89, n=88, x=681472, y=23497, z=534] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=89, n=88, x=681472, y=23497, z=534] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=89, n=88, x=681472, y=23497, z=534] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=89, n=88, x=681472, y=23497, z=534] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=89] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=89, n=88, x=681472, y=23497, z=534] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=89, n=89, x=704969, y=24031, z=540] [L33] EXPR counter++ VAL [a=100, counter=90, counter++=89, n=89, x=704969, y=24031, z=540] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=90, n=89, x=704969, y=24031, z=540] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=90, n=89, x=704969, y=24031, z=540] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=90, n=89, x=704969, y=24031, z=540] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=90, n=89, x=704969, y=24031, z=540] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=90] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=90, n=89, x=704969, y=24031, z=540] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=90, n=90, x=729000, y=24571, z=546] [L33] EXPR counter++ VAL [a=100, counter=91, counter++=90, n=90, x=729000, y=24571, z=546] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=91, n=90, x=729000, y=24571, z=546] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=91, n=90, x=729000, y=24571, z=546] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=91, n=90, x=729000, y=24571, z=546] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=91, n=90, x=729000, y=24571, z=546] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=91] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=91, n=90, x=729000, y=24571, z=546] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=91, n=91, x=753571, y=25117, z=552] [L33] EXPR counter++ VAL [a=100, counter=92, counter++=91, n=91, x=753571, y=25117, z=552] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=92, n=91, x=753571, y=25117, z=552] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=92, n=91, x=753571, y=25117, z=552] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=92, n=91, x=753571, y=25117, z=552] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=92, n=91, x=753571, y=25117, z=552] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=92] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=92, n=91, x=753571, y=25117, z=552] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=92, n=92, x=778688, y=25669, z=558] [L33] EXPR counter++ VAL [a=100, counter=93, counter++=92, n=92, x=778688, y=25669, z=558] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=93, n=92, x=778688, y=25669, z=558] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=93, n=92, x=778688, y=25669, z=558] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=93, n=92, x=778688, y=25669, z=558] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=93, n=92, x=778688, y=25669, z=558] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=93] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=93, n=92, x=778688, y=25669, z=558] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=93, n=93, x=804357, y=26227, z=564] [L33] EXPR counter++ VAL [a=100, counter=94, counter++=93, n=93, x=804357, y=26227, z=564] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=94, n=93, x=804357, y=26227, z=564] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=94, n=93, x=804357, y=26227, z=564] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=94, n=93, x=804357, y=26227, z=564] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=94, n=93, x=804357, y=26227, z=564] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=94] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=94, n=93, x=804357, y=26227, z=564] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=94, n=94, x=830584, y=26791, z=570] [L33] EXPR counter++ VAL [a=100, counter=95, counter++=94, n=94, x=830584, y=26791, z=570] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=95, n=94, x=830584, y=26791, z=570] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=95, n=94, x=830584, y=26791, z=570] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=95, n=94, x=830584, y=26791, z=570] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=95, n=94, x=830584, y=26791, z=570] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=95] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=95, n=94, x=830584, y=26791, z=570] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=95, n=95, x=857375, y=27361, z=576] [L33] EXPR counter++ VAL [a=100, counter=96, counter++=95, n=95, x=857375, y=27361, z=576] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=96, n=95, x=857375, y=27361, z=576] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=96, n=95, x=857375, y=27361, z=576] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=96, n=95, x=857375, y=27361, z=576] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=96, n=95, x=857375, y=27361, z=576] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=96] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=96, n=95, x=857375, y=27361, z=576] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=96, n=96, x=884736, y=27937, z=582] [L33] EXPR counter++ VAL [a=100, counter=97, counter++=96, n=96, x=884736, y=27937, z=582] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=97, n=96, x=884736, y=27937, z=582] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=97, n=96, x=884736, y=27937, z=582] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=97, n=96, x=884736, y=27937, z=582] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=97, n=96, x=884736, y=27937, z=582] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=97] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=97, n=96, x=884736, y=27937, z=582] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=97, n=97, x=912673, y=28519, z=588] [L33] EXPR counter++ VAL [a=100, counter=98, counter++=97, n=97, x=912673, y=28519, z=588] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=98, n=97, x=912673, y=28519, z=588] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=98, n=97, x=912673, y=28519, z=588] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=98, n=97, x=912673, y=28519, z=588] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=98, n=97, x=912673, y=28519, z=588] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=98] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=98, n=97, x=912673, y=28519, z=588] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=98, n=98, x=941192, y=29107, z=594] [L33] EXPR counter++ VAL [a=100, counter=99, counter++=98, n=98, x=941192, y=29107, z=594] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=99, n=98, x=941192, y=29107, z=594] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=99, n=98, x=941192, y=29107, z=594] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=99, n=98, x=941192, y=29107, z=594] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=99, n=98, x=941192, y=29107, z=594] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=99] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=99, n=98, x=941192, y=29107, z=594] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=99, n=99, x=970299, y=29701, z=600] [L33] EXPR counter++ VAL [a=100, counter=100, counter++=99, n=99, x=970299, y=29701, z=600] [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=100, counter=100, n=99, x=970299, y=29701, z=600] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=100, counter=100, n=99, x=970299, y=29701, z=600] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=100, counter=100, n=99, x=970299, y=29701, z=600] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=100, counter=100, n=99, x=970299, y=29701, z=600] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=100] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=100, counter=100, n=99, x=970299, y=29701, z=600] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=100, counter=100, n=100, x=1000000, y=30301, z=606] [L33] EXPR counter++ VAL [a=100, counter=101, counter++=100, n=100, x=1000000, y=30301, z=606] [L33] COND FALSE !(counter++<100) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=101] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=101] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=100, counter=101, n=100, x=1000000, y=30301, z=606] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=101] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 230.3s, OverallIterations: 19, TraceHistogramMax: 502, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 65.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1431 SdHoareTripleChecker+Valid, 33.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1380 mSDsluCounter, 6107 SdHoareTripleChecker+Invalid, 31.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4283 mSDsCounter, 1022 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10925 IncrementalHoareTripleChecker+Invalid, 11952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1022 mSolverCounterUnsat, 1824 mSDtfsCounter, 10925 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17350 GetRequests, 16339 SyntacticMatches, 98 SemanticMatches, 913 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26952 ImplicationChecksByTransitivity, 106.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2809occurred in iteration=18, InterpolantAutomatonStates: 673, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 8527 NumberOfCodeBlocks, 8398 NumberOfCodeBlocksAsserted, 195 NumberOfCheckSat, 11307 ConstructedInterpolants, 0 QuantifiedInterpolants, 32209 SizeOfPredicates, 218 NumberOfNonLiveVariables, 12183 ConjunctsInSsa, 697 ConjunctsInUnsatCore, 32 InterpolantComputations, 3 PerfectInterpolantSequences, 601674/1263174 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: 0.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 10, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 10, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 4, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 16, TOOLS_QUANTIFIERELIM_TIME: 0.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 27, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME: 0.0s, 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: 10, DOMAIN_ISBOTTOM_TIME: 0.0s, 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: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, 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: 55, DAG_COMPRESSION_RETAINED_NODES: 31, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 23:42:43,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d078f6-7b0d-49c8-8fdc-0682163cb569/bin/utaipan-ByfvJB40ur/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