./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/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_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS --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-8393723 [2022-11-19 07:40:06,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:40:06,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:40:06,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:40:06,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:40:06,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:40:06,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:40:06,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:40:06,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:40:06,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:40:06,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:40:06,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:40:06,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:40:06,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:40:06,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:40:06,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:40:06,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:40:06,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:40:07,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:40:07,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:40:07,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:40:07,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:40:07,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:40:07,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:40:07,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:40:07,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:40:07,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:40:07,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:40:07,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:40:07,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:40:07,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:40:07,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:40:07,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:40:07,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:40:07,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:40:07,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:40:07,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:40:07,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:40:07,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:40:07,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:40:07,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:40:07,043 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:40:07,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:40:07,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:40:07,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:40:07,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:40:07,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:40:07,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:40:07,091 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:40:07,091 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:40:07,091 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:40:07,092 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:40:07,093 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:40:07,093 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:40:07,093 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:40:07,093 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:40:07,094 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:40:07,094 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:40:07,094 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:40:07,094 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:40:07,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:40:07,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:40:07,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:40:07,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:40:07,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:40:07,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:40:07,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:40:07,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:40:07,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:40:07,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:40:07,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:40:07,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:40:07,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:40:07,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:40:07,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:40:07,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:40:07,099 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:40:07,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:40:07,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:40:07,099 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:40:07,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:40:07,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:40:07,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:40:07,100 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_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/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_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS 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-19 07:40:07,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:40:07,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:40:07,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:40:07,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:40:07,445 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:40:07,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-11-19 07:40:07,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/data/0b396ef98/89c1e353d3734373a73f85ba6154fb75/FLAG2dd120d5b [2022-11-19 07:40:08,071 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:40:08,074 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-11-19 07:40:08,083 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/data/0b396ef98/89c1e353d3734373a73f85ba6154fb75/FLAG2dd120d5b [2022-11-19 07:40:08,428 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/data/0b396ef98/89c1e353d3734373a73f85ba6154fb75 [2022-11-19 07:40:08,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:40:08,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:40:08,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:40:08,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:40:08,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:40:08,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe7905d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08, skipping insertion in model container [2022-11-19 07:40:08,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:40:08,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:40:08,668 WARN L234 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_70a6a975-78a8-42e6-b1a5-d91badf7abc6/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-11-19 07:40:08,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:40:08,701 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:40:08,714 WARN L234 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_70a6a975-78a8-42e6-b1a5-d91badf7abc6/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-11-19 07:40:08,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:40:08,738 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:40:08,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08 WrapperNode [2022-11-19 07:40:08,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:40:08,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:40:08,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:40:08,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:40:08,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,774 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-11-19 07:40:08,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:40:08,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:40:08,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:40:08,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:40:08,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,796 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:40:08,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:40:08,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:40:08,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:40:08,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (1/1) ... [2022-11-19 07:40:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:40:08,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:08,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:40:08,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:40:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:40:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:40:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:40:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:40:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 07:40:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 07:40:08,963 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:40:08,966 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:40:09,230 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:40:09,273 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:40:09,274 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 07:40:09,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:09 BoogieIcfgContainer [2022-11-19 07:40:09,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:40:09,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:40:09,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:40:09,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:40:09,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:08" (1/3) ... [2022-11-19 07:40:09,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f773745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:09, skipping insertion in model container [2022-11-19 07:40:09,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:08" (2/3) ... [2022-11-19 07:40:09,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f773745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:09, skipping insertion in model container [2022-11-19 07:40:09,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:09" (3/3) ... [2022-11-19 07:40:09,301 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.c [2022-11-19 07:40:09,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:40:09,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:40:09,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:40:09,429 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;@1e8c3aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:40:09,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:40:09,434 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-19 07:40:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:40:09,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:09,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 07:40:09,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1408153759, now seen corresponding path program 1 times [2022-11-19 07:40:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285806424] [2022-11-19 07:40:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:09,671 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-19 07:40:09,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285806424] [2022-11-19 07:40:09,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285806424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:09,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:40:09,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:40:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141959078] [2022-11-19 07:40:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:40:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:40:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:40:09,725 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-19 07:40:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:09,776 INFO L93 Difference]: Finished difference Result 45 states and 82 transitions. [2022-11-19 07:40:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:40:09,786 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-19 07:40:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:09,798 INFO L225 Difference]: With dead ends: 45 [2022-11-19 07:40:09,798 INFO L226 Difference]: Without dead ends: 21 [2022-11-19 07:40:09,803 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-19 07:40:09,808 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-19 07:40:09,809 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-19 07:40:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-19 07:40:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-19 07:40:09,888 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-19 07:40:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2022-11-19 07:40:09,892 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 6 [2022-11-19 07:40:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:09,893 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2022-11-19 07:40:09,893 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-19 07:40:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2022-11-19 07:40:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:40:09,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:09,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:09,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:40:09,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:09,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1232571916, now seen corresponding path program 1 times [2022-11-19 07:40:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:09,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919706420] [2022-11-19 07:40:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:10,066 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-19 07:40:10,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919706420] [2022-11-19 07:40:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919706420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:10,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:40:10,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:40:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771167401] [2022-11-19 07:40:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:40:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:40:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:40:10,071 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-19 07:40:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:10,097 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2022-11-19 07:40:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:40:10,098 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-19 07:40:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:10,099 INFO L225 Difference]: With dead ends: 35 [2022-11-19 07:40:10,100 INFO L226 Difference]: Without dead ends: 23 [2022-11-19 07:40:10,100 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-19 07:40:10,102 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-19 07:40:10,103 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-19 07:40:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-19 07:40:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-19 07:40:10,110 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-19 07:40:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2022-11-19 07:40:10,111 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 7 [2022-11-19 07:40:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:10,112 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-11-19 07:40:10,112 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-19 07:40:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-11-19 07:40:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:40:10,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:10,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:10,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:40:10,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1231022784, now seen corresponding path program 1 times [2022-11-19 07:40:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:10,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658414436] [2022-11-19 07:40:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:10,310 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-19 07:40:10,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658414436] [2022-11-19 07:40:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658414436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:10,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:40:10,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:40:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457860366] [2022-11-19 07:40:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:10,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:40:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:40:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:40:10,316 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-19 07:40:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:10,477 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-19 07:40:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:40:10,478 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-19 07:40:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:10,479 INFO L225 Difference]: With dead ends: 29 [2022-11-19 07:40:10,479 INFO L226 Difference]: Without dead ends: 27 [2022-11-19 07:40:10,480 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-19 07:40:10,481 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-19 07:40:10,483 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-19 07:40:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-19 07:40:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-19 07:40:10,497 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-19 07:40:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-19 07:40:10,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2022-11-19 07:40:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:10,503 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-19 07:40:10,504 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-19 07:40:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-11-19 07:40:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:40:10,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:10,505 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:10,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:40:10,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1004679035, now seen corresponding path program 1 times [2022-11-19 07:40:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:10,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843779560] [2022-11-19 07:40:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:10,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:10,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464053046] [2022-11-19 07:40:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:10,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:10,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:10,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:10,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:40:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:10,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:40:10,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:10,790 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-19 07:40:10,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:10,955 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-19 07:40:10,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:10,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843779560] [2022-11-19 07:40:10,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:10,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464053046] [2022-11-19 07:40:10,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464053046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:10,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [759118324] [2022-11-19 07:40:10,976 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-19 07:40:10,976 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:10,980 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:10,986 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:10,986 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:11,212 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-19 07:40:11,230 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:11,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [759118324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:11,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:11,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2022-11-19 07:40:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27021983] [2022-11-19 07:40:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:11,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:40:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:40:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:11,698 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-19 07:40:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:11,747 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-11-19 07:40:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:40:11,748 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-19 07:40:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:11,751 INFO L225 Difference]: With dead ends: 39 [2022-11-19 07:40:11,751 INFO L226 Difference]: Without dead ends: 37 [2022-11-19 07:40:11,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:11,756 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:11,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-11-19 07:40:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-19 07:40:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-19 07:40:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 07:40:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-11-19 07:40:11,788 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 12 [2022-11-19 07:40:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:11,789 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-11-19 07:40:11,789 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-19 07:40:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-11-19 07:40:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:40:11,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:11,791 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:11,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:11,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:11,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash 752381984, now seen corresponding path program 1 times [2022-11-19 07:40:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:11,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317354806] [2022-11-19 07:40:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:12,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:12,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212950443] [2022-11-19 07:40:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:12,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:12,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:12,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:12,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:40:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:12,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:40:12,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:40:12,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:40:12,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:12,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317354806] [2022-11-19 07:40:12,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:12,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212950443] [2022-11-19 07:40:12,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212950443] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:12,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1119068092] [2022-11-19 07:40:12,264 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-19 07:40:12,265 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:12,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:12,265 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:12,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:12,443 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-19 07:40:12,455 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:12,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1119068092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:12,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:12,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2022-11-19 07:40:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138359798] [2022-11-19 07:40:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:12,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:40:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:12,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:40:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:12,962 INFO L87 Difference]: Start difference. First operand 37 states and 47 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:40:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:13,019 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-11-19 07:40:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:40:13,019 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-19 07:40:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:13,021 INFO L225 Difference]: With dead ends: 44 [2022-11-19 07:40:13,022 INFO L226 Difference]: Without dead ends: 42 [2022-11-19 07:40:13,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:13,023 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:13,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 45 Unchecked, 0.0s Time] [2022-11-19 07:40:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-19 07:40:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-19 07:40:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:40:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-11-19 07:40:13,045 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 17 [2022-11-19 07:40:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:13,045 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-11-19 07:40:13,046 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:40:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-11-19 07:40:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:40:13,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:13,047 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:13,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:13,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:13,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2088406747, now seen corresponding path program 1 times [2022-11-19 07:40:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:13,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330445019] [2022-11-19 07:40:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:13,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:13,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759693389] [2022-11-19 07:40:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:13,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:13,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:13,271 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:13,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:40:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:13,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 07:40:13,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:40:13,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:40:13,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:13,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330445019] [2022-11-19 07:40:13,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:13,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759693389] [2022-11-19 07:40:13,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759693389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645608841] [2022-11-19 07:40:13,734 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:40:13,734 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:13,734 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:13,735 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:13,735 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:14,027 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-19 07:40:14,049 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:14,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [645608841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:14,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:14,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2022-11-19 07:40:14,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900627571] [2022-11-19 07:40:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:14,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:40:14,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:14,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:40:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:14,624 INFO L87 Difference]: Start difference. First operand 42 states and 52 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:40:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:14,680 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-11-19 07:40:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:40:14,681 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-11-19 07:40:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:14,683 INFO L225 Difference]: With dead ends: 49 [2022-11-19 07:40:14,683 INFO L226 Difference]: Without dead ends: 47 [2022-11-19 07:40:14,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:14,687 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:14,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 91 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-11-19 07:40:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-19 07:40:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-19 07:40:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 07:40:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-11-19 07:40:14,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 22 [2022-11-19 07:40:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:14,707 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-11-19 07:40:14,707 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:40:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-11-19 07:40:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:40:14,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:14,708 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:14,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:14,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-19 07:40:14,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 242639616, now seen corresponding path program 1 times [2022-11-19 07:40:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:14,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718272410] [2022-11-19 07:40:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:14,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843016797] [2022-11-19 07:40:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:14,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:14,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:40:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:14,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:40:14,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 07:40:15,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 07:40:15,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:15,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718272410] [2022-11-19 07:40:15,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:15,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843016797] [2022-11-19 07:40:15,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843016797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:15,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1426348969] [2022-11-19 07:40:15,212 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-19 07:40:15,212 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:15,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:15,214 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:15,214 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:15,514 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-19 07:40:15,524 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:16,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1426348969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:16,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:16,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2022-11-19 07:40:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779708894] [2022-11-19 07:40:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:16,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:40:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:40:16,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:16,194 INFO L87 Difference]: Start difference. First operand 47 states and 57 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:40:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:16,274 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-11-19 07:40:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:40:16,274 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2022-11-19 07:40:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:16,275 INFO L225 Difference]: With dead ends: 54 [2022-11-19 07:40:16,275 INFO L226 Difference]: Without dead ends: 52 [2022-11-19 07:40:16,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:16,276 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 89 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 53 Unchecked, 0.0s Time] [2022-11-19 07:40:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-19 07:40:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-19 07:40:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 30 states have internal predecessors, (31), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-19 07:40:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-11-19 07:40:16,296 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 27 [2022-11-19 07:40:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:16,297 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-11-19 07:40:16,297 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:40:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-11-19 07:40:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 07:40:16,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:16,298 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:16,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:16,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 07:40:16,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1647453060, now seen corresponding path program 1 times [2022-11-19 07:40:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:16,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282150945] [2022-11-19 07:40:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:16,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:16,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941944269] [2022-11-19 07:40:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:16,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:16,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:40:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:16,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:40:16,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-19 07:40:16,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:16,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:16,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282150945] [2022-11-19 07:40:16,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:16,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941944269] [2022-11-19 07:40:16,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941944269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:16,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910660138] [2022-11-19 07:40:16,768 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:40:16,768 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:16,768 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:16,769 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:16,769 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:17,256 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-19 07:40:17,270 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:22,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1910660138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:22,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:40:22,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-11-19 07:40:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289180157] [2022-11-19 07:40:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:22,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:40:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:40:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-19 07:40:22,316 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 07:40:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:22,379 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-11-19 07:40:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:40:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-11-19 07:40:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:22,381 INFO L225 Difference]: With dead ends: 65 [2022-11-19 07:40:22,381 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 07:40:22,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-19 07:40:22,382 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:22,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 102 Unchecked, 0.0s Time] [2022-11-19 07:40:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 07:40:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 07:40:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 07:40:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-11-19 07:40:22,401 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 38 [2022-11-19 07:40:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:22,401 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-11-19 07:40:22,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 07:40:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-11-19 07:40:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 07:40:22,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:22,403 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-19 07:40:22,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:22,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:22,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash 204620983, now seen corresponding path program 1 times [2022-11-19 07:40:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:22,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891926336] [2022-11-19 07:40:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:22,626 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:22,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784632083] [2022-11-19 07:40:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:22,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:22,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:22,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:40:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:22,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:40:22,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:22,766 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-19 07:40:22,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:22,843 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-19 07:40:22,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:22,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891926336] [2022-11-19 07:40:22,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:22,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784632083] [2022-11-19 07:40:22,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784632083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:22,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967605686] [2022-11-19 07:40:22,850 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:40:22,850 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:22,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:22,851 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:22,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:26,297 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:40:26,302 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:31,089 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1947#(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-19 07:40:31,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:40:31,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:31,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-19 07:40:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174919021] [2022-11-19 07:40:31,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:40:31,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:40:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:40:31,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-11-19 07:40:31,092 INFO L87 Difference]: Start difference. First operand 63 states and 74 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-19 07:40:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:31,376 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2022-11-19 07:40:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:40:31,377 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-19 07:40:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:31,380 INFO L225 Difference]: With dead ends: 139 [2022-11-19 07:40:31,380 INFO L226 Difference]: Without dead ends: 123 [2022-11-19 07:40:31,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:40:31,385 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 71 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:31,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 242 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:40:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-19 07:40:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2022-11-19 07:40:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 44 states have call successors, (44), 14 states have call predecessors, (44), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-19 07:40:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2022-11-19 07:40:31,428 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 40 [2022-11-19 07:40:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:31,428 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-11-19 07:40:31,429 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-19 07:40:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-11-19 07:40:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 07:40:31,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:31,430 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-19 07:40:31,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:31,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:31,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 696736299, now seen corresponding path program 1 times [2022-11-19 07:40:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:31,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729357941] [2022-11-19 07:40:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:31,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:31,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307491691] [2022-11-19 07:40:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:31,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:31,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:40:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:31,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-19 07:40:31,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:31,861 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-19 07:40:31,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:32,055 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-19 07:40:32,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729357941] [2022-11-19 07:40:32,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307491691] [2022-11-19 07:40:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307491691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788385891] [2022-11-19 07:40:32,058 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 07:40:32,058 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:32,058 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:32,058 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:32,058 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:35,291 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-19 07:40:35,338 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:37,683 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2604#(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-19 07:40:37,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:40:37,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:37,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-19 07:40:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250818889] [2022-11-19 07:40:37,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:40:37,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:40:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:40:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:40:37,686 INFO L87 Difference]: Start difference. First operand 117 states and 151 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-19 07:40:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:38,514 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2022-11-19 07:40:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:40:38,516 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-19 07:40:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:38,518 INFO L225 Difference]: With dead ends: 135 [2022-11-19 07:40:38,518 INFO L226 Difference]: Without dead ends: 133 [2022-11-19 07:40:38,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:40:38,519 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:38,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 07:40:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-19 07:40:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-19 07:40:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 74 states have internal predecessors, (79), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-19 07:40:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2022-11-19 07:40:38,552 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 40 [2022-11-19 07:40:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:38,552 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2022-11-19 07:40:38,552 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-19 07:40:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2022-11-19 07:40:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 07:40:38,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:38,554 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-19 07:40:38,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:38,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:38,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1539244486, now seen corresponding path program 2 times [2022-11-19 07:40:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:38,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924314701] [2022-11-19 07:40:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:38,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:38,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542620114] [2022-11-19 07:40:38,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:40:38,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:38,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:38,782 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:38,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:40:38,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:40:38,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:40:38,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:40:38,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:38,936 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-19 07:40:38,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:39,030 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-19 07:40:39,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924314701] [2022-11-19 07:40:39,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:40:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542620114] [2022-11-19 07:40:39,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542620114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:39,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452733270] [2022-11-19 07:40:39,040 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 07:40:39,040 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:39,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:39,040 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:39,041 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:42,372 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:40:42,377 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:43,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3300#(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-19 07:40:43,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:40:43,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:43,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-19 07:40:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892518386] [2022-11-19 07:40:43,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:40:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:40:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:40:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-11-19 07:40:43,205 INFO L87 Difference]: Start difference. First operand 133 states and 163 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-19 07:40:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:43,463 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2022-11-19 07:40:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:40:43,464 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-19 07:40:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:43,465 INFO L225 Difference]: With dead ends: 139 [2022-11-19 07:40:43,465 INFO L226 Difference]: Without dead ends: 137 [2022-11-19 07:40:43,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-19 07:40:43,467 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:43,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 208 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:40:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-19 07:40:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-19 07:40:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 77 states have internal predecessors, (82), 44 states have call successors, (44), 19 states have call predecessors, (44), 19 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-19 07:40:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2022-11-19 07:40:43,502 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 45 [2022-11-19 07:40:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:43,503 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2022-11-19 07:40:43,503 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-19 07:40:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2022-11-19 07:40:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 07:40:43,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:43,511 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:43,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:43,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 07:40:43,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:43,717 INFO L85 PathProgramCache]: Analyzing trace with hash -743936932, now seen corresponding path program 1 times [2022-11-19 07:40:43,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:43,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851198613] [2022-11-19 07:40:43,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:43,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:43,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:40:43,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146098129] [2022-11-19 07:40:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:43,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:43,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:43,726 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:43,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:40:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:43,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 07:40:43,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-19 07:40:43,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:41:13,010 WARN L859 $PredicateComparison]: unable to prove that (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_144| Int) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251| Int) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_246| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_246|))) (or (= (mod (+ (* (- 2) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238|) (div (- .cse0) (- 6))) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238|) 0) (= (+ (* |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| 18) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251| 10) 10 (* 3 .cse0)) (+ (* 2 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251|)) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_246| 3))) (= |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| 0) (not (= (+ (* |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| 12) (* 6 (* |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_144| |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238|))) .cse0))))) (not (= |c___VERIFIER_assert_#in~cond| 1))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2022-11-19 07:41:57,235 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:42:11,310 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_144| Int) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251| Int) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_246| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_246|))) (or (= (mod (+ (* (- 2) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238|) (div (- .cse0) (- 6))) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238|) 0) (= (+ (* |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| 18) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251| 10) 10 (* 3 .cse0)) (+ (* 2 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_251|)) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_246| 3))) (= |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| 0) (not (= (+ (* |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238| 12) (* 6 (* |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_144| |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_238|))) .cse0))))) (not (= |c___VERIFIER_assert_#in~cond| 1))) is different from true [2022-11-19 07:42:27,989 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:42:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 35 proven. 21 refuted. 3 times theorem prover too weak. 66 trivial. 3 not checked. [2022-11-19 07:42:42,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:42,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851198613] [2022-11-19 07:42:42,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:42:42,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146098129] [2022-11-19 07:42:42,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146098129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:42,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [585545925] [2022-11-19 07:42:42,176 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-19 07:42:42,176 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:42:42,177 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:42:42,177 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:42:42,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:42:42,723 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-19 07:42:42,732 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:43:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [585545925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:43:24,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:43:24,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 11] total 22 [2022-11-19 07:43:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163139906] [2022-11-19 07:43:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:43:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:43:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:43:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=8, NotChecked=74, Total=462 [2022-11-19 07:43:24,745 INFO L87 Difference]: Start difference. First operand 137 states and 166 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:43:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:43:24,809 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2022-11-19 07:43:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:43:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2022-11-19 07:43:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:43:24,812 INFO L225 Difference]: With dead ends: 147 [2022-11-19 07:43:24,812 INFO L226 Difference]: Without dead ends: 143 [2022-11-19 07:43:24,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 98 SyntacticMatches, 24 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 78.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=8, NotChecked=74, Total=462 [2022-11-19 07:43:24,813 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:43:24,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 94 Unchecked, 0.0s Time] [2022-11-19 07:43:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-19 07:43:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-19 07:43:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 81 states have internal predecessors, (86), 44 states have call successors, (44), 21 states have call predecessors, (44), 20 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-19 07:43:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2022-11-19 07:43:24,840 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 48 [2022-11-19 07:43:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:43:24,840 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2022-11-19 07:43:24,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:43:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2022-11-19 07:43:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 07:43:24,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:43:24,842 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-19 07:43:24,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:43:25,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:25,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:43:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:43:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash -375151797, now seen corresponding path program 3 times [2022-11-19 07:43:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:43:25,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208271369] [2022-11-19 07:43:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:25,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:43:25,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:43:25,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864395970] [2022-11-19 07:43:25,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:43:25,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:25,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:43:25,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:43:25,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:43:25,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:43:25,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:43:25,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 07:43:25,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:43:25,294 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-19 07:43:25,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:43:25,705 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-19 07:43:25,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:43:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208271369] [2022-11-19 07:43:25,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:43:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864395970] [2022-11-19 07:43:25,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864395970] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:43:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769998396] [2022-11-19 07:43:25,708 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 07:43:25,708 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:43:25,708 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:43:25,709 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:43:25,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:43:28,800 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-19 07:43:28,840 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:43:33,807 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4768#(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-19 07:43:33,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:43:33,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:43:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-19 07:43:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957066716] [2022-11-19 07:43:33,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:43:33,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 07:43:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 07:43:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:43:33,809 INFO L87 Difference]: Start difference. First operand 143 states and 170 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-19 07:43:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:43:35,111 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2022-11-19 07:43:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:43:35,132 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-19 07:43:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:43:35,136 INFO L225 Difference]: With dead ends: 169 [2022-11-19 07:43:35,137 INFO L226 Difference]: Without dead ends: 130 [2022-11-19 07:43:35,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:43:35,144 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:43:35,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 67 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-19 07:43:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-19 07:43:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-19 07:43:35,178 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-19 07:43:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-11-19 07:43:35,186 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 50 [2022-11-19 07:43:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:43:35,187 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-11-19 07:43:35,187 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-19 07:43:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-11-19 07:43:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 07:43:35,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:43:35,190 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-19 07:43:35,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:43:35,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:35,396 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:43:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:43:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash 780075682, now seen corresponding path program 1 times [2022-11-19 07:43:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:43:35,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760212853] [2022-11-19 07:43:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:43:35,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:43:35,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144729621] [2022-11-19 07:43:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:35,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:43:35,404 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:43:35,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 07:43:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:43:35,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-19 07:43:35,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:43:36,031 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-19 07:43:36,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:43:36,416 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-19 07:43:36,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:43:36,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760212853] [2022-11-19 07:43:36,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:43:36,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144729621] [2022-11-19 07:43:36,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144729621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:43:36,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [649856294] [2022-11-19 07:43:36,426 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:43:36,426 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:43:36,427 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:43:36,427 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:43:36,430 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:43:39,894 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2022-11-19 07:43:39,903 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:43:41,245 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5620#(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-19 07:43:41,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:43:41,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:43:41,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-19 07:43:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147233599] [2022-11-19 07:43:41,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:43:41,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 07:43:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:41,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 07:43:41,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-11-19 07:43:41,247 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-19 07:43:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:43:42,068 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-19 07:43:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:43:42,068 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-19 07:43:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:43:42,069 INFO L225 Difference]: With dead ends: 146 [2022-11-19 07:43:42,070 INFO L226 Difference]: Without dead ends: 142 [2022-11-19 07:43:42,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-11-19 07:43:42,071 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:43:42,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 64 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:43:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-19 07:43:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-19 07:43:42,099 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-19 07:43:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2022-11-19 07:43:42,100 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 66 [2022-11-19 07:43:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:43:42,101 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2022-11-19 07:43:42,101 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-19 07:43:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2022-11-19 07:43:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-19 07:43:42,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:43:42,102 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-19 07:43:42,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:43:42,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 07:43:42,308 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:43:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:43:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1686864157, now seen corresponding path program 1 times [2022-11-19 07:43:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:43:42,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037357759] [2022-11-19 07:43:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:43:42,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:43:42,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705596358] [2022-11-19 07:43:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:42,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:43:42,323 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:43:42,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 07:43:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:43:42,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-19 07:43:42,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:43:42,877 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-19 07:43:42,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:43:43,270 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-19 07:43:43,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:43:43,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037357759] [2022-11-19 07:43:43,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:43:43,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705596358] [2022-11-19 07:43:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705596358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:43:43,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2115602161] [2022-11-19 07:43:43,273 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-19 07:43:43,273 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:43:43,274 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:43:43,274 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:43:43,274 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:43:46,688 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2022-11-19 07:43:46,698 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:43:48,198 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6489#(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-19 07:43:48,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:43:48,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:43:48,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-19 07:43:48,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896095760] [2022-11-19 07:43:48,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:43:48,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 07:43:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 07:43:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:43:48,201 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2022-11-19 07:43:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:43:49,365 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2022-11-19 07:43:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 07:43:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 71 [2022-11-19 07:43:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:43:49,368 INFO L225 Difference]: With dead ends: 162 [2022-11-19 07:43:49,368 INFO L226 Difference]: Without dead ends: 133 [2022-11-19 07:43:49,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 07:43:49,370 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:43:49,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 62 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 07:43:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-19 07:43:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2022-11-19 07:43:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 30 states have call successors, (30), 21 states have call predecessors, (30), 21 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-19 07:43:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-11-19 07:43:49,412 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 71 [2022-11-19 07:43:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:43:49,412 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-11-19 07:43:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2022-11-19 07:43:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-11-19 07:43:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-19 07:43:49,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:43:49,414 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-19 07:43:49,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:43:49,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 07:43:49,619 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:43:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:43:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash -226115244, now seen corresponding path program 4 times [2022-11-19 07:43:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:43:49,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912310948] [2022-11-19 07:43:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:49,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:43:49,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:43:49,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124672330] [2022-11-19 07:43:49,628 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:43:49,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:49,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:43:49,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:43:49,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 07:43:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:43:49,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-19 07:43:49,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:43:49,962 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-19 07:43:49,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:43:50,360 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-19 07:43:50,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:43:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912310948] [2022-11-19 07:43:50,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:43:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124672330] [2022-11-19 07:43:50,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124672330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:43:50,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1500987606] [2022-11-19 07:43:50,362 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 07:43:50,362 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:43:50,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:43:50,363 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:43:50,363 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:43:53,607 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:43:53,612 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:43:54,542 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7385#(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-19 07:43:54,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:43:54,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:43:54,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-19 07:43:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949860321] [2022-11-19 07:43:54,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:43:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 07:43:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 07:43:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-11-19 07:43:54,545 INFO L87 Difference]: Start difference. First operand 132 states and 143 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-19 07:43:57,203 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-19 07:44:00,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-19 07:44:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:44:00,560 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-11-19 07:44:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 07:44:00,560 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-19 07:44:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:44:00,562 INFO L225 Difference]: With dead ends: 146 [2022-11-19 07:44:00,562 INFO L226 Difference]: Without dead ends: 144 [2022-11-19 07:44:00,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2022-11-19 07:44:00,563 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 118 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:44:00,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 86 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 399 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-11-19 07:44:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-19 07:44:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2022-11-19 07:44:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 30 states have call successors, (30), 22 states have call predecessors, (30), 22 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-19 07:44:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-11-19 07:44:00,616 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 73 [2022-11-19 07:44:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:44:00,617 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-11-19 07:44:00,617 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-19 07:44:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-11-19 07:44:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-19 07:44:00,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:44:00,619 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-19 07:44:00,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:44:00,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:44:00,825 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:44:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:44:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2067588009, now seen corresponding path program 2 times [2022-11-19 07:44:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:44:00,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386466997] [2022-11-19 07:44:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:44:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:44:00,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:44:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804065242] [2022-11-19 07:44:00,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:44:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:44:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:44:00,841 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:44:00,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 07:44:01,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-19 07:44:01,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:44:01,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 07:44:01,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:44:02,030 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-19 07:44:02,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:44:02,213 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-19 07:44:02,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:44:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386466997] [2022-11-19 07:44:02,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:44:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804065242] [2022-11-19 07:44:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804065242] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:44:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620713345] [2022-11-19 07:44:02,215 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:44:02,216 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:44:02,216 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:44:02,216 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:44:02,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:44:05,319 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:44:05,323 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:44:06,132 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8568#(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-19 07:44:06,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:44:06,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:44:06,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-19 07:44:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462225080] [2022-11-19 07:44:06,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:44:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 07:44:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:44:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 07:44:06,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2022-11-19 07:44:06,135 INFO L87 Difference]: Start difference. First operand 136 states and 145 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-19 07:44:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:44:06,708 INFO L93 Difference]: Finished difference Result 376 states and 391 transitions. [2022-11-19 07:44:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 07:44:06,709 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-19 07:44:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:44:06,711 INFO L225 Difference]: With dead ends: 376 [2022-11-19 07:44:06,711 INFO L226 Difference]: Without dead ends: 353 [2022-11-19 07:44:06,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2022-11-19 07:44:06,712 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 137 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:44:06,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 322 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:44:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-19 07:44:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-11-19 07:44:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 195 states have (on average 1.041025641025641) internal successors, (203), 201 states have internal predecessors, (203), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-19 07:44:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 325 transitions. [2022-11-19 07:44:06,802 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 325 transitions. Word has length 124 [2022-11-19 07:44:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:44:06,802 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 325 transitions. [2022-11-19 07:44:06,803 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-19 07:44:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 325 transitions. [2022-11-19 07:44:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-19 07:44:06,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:44:06,805 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:44:06,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 07:44:07,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 07:44:07,012 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:44:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:44:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1345487281, now seen corresponding path program 2 times [2022-11-19 07:44:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:44:07,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183765878] [2022-11-19 07:44:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:44:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:44:07,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:44:07,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604872409] [2022-11-19 07:44:07,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:44:07,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:44:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:44:07,037 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:44:07,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 07:44:09,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-19 07:44:09,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:44:09,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-19 07:44:09,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:44:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 326 proven. 61 refuted. 0 times theorem prover too weak. 1151 trivial. 0 not checked. [2022-11-19 07:44:25,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:44:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 200 proven. 39 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2022-11-19 07:44:30,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:44:30,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183765878] [2022-11-19 07:44:30,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:44:30,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604872409] [2022-11-19 07:44:30,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604872409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:44:30,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1320112679] [2022-11-19 07:44:30,037 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-19 07:44:30,041 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:44:30,041 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:44:30,042 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:44:30,042 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:44:33,020 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-19 07:44:33,056 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:44:41,508 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10503#(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-19 07:44:41,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:44:41,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:44:41,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2022-11-19 07:44:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272309266] [2022-11-19 07:44:41,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:44:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 07:44:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:44:41,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 07:44:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=784, Unknown=1, NotChecked=0, Total=930 [2022-11-19 07:44:41,511 INFO L87 Difference]: Start difference. First operand 311 states and 325 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2022-11-19 07:44:46,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-19 07:44:48,911 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-19 07:44:53,763 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-19 07:44:55,768 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-19 07:44:58,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-19 07:45:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:45:00,378 INFO L93 Difference]: Finished difference Result 318 states and 331 transitions. [2022-11-19 07:45:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:45:00,379 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) Word has length 155 [2022-11-19 07:45:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:45:00,381 INFO L225 Difference]: With dead ends: 318 [2022-11-19 07:45:00,381 INFO L226 Difference]: Without dead ends: 292 [2022-11-19 07:45:00,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 431 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=192, Invalid=1067, Unknown=1, NotChecked=0, Total=1260 [2022-11-19 07:45:00,382 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:45:00,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 102 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 302 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2022-11-19 07:45:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-19 07:45:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-19 07:45:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 187 states have (on average 1.0106951871657754) internal successors, (189), 188 states have internal predecessors, (189), 53 states have call successors, (53), 51 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-19 07:45:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 294 transitions. [2022-11-19 07:45:00,474 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 294 transitions. Word has length 155 [2022-11-19 07:45:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:45:00,475 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 294 transitions. [2022-11-19 07:45:00,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2022-11-19 07:45:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 294 transitions. [2022-11-19 07:45:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-19 07:45:00,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:45:00,480 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-19 07:45:00,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:45:00,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:45:00,688 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:45:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:45:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1818744179, now seen corresponding path program 3 times [2022-11-19 07:45:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:45:00,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105891539] [2022-11-19 07:45:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:45:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:45:00,703 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:45:00,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131408307] [2022-11-19 07:45:00,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:45:00,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:00,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:45:00,705 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:45:00,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 07:45:00,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:45:00,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:45:00,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-19 07:45:00,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:45:01,348 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-19 07:45:01,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:45:01,824 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-19 07:45:01,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:45:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105891539] [2022-11-19 07:45:01,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:45:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131408307] [2022-11-19 07:45:01,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131408307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:45:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [334499131] [2022-11-19 07:45:01,826 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:45:01,826 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:45:01,827 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:45:01,827 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:45:01,827 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:45:04,327 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:45:04,331 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:45:07,399 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13153#(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-19 07:45:07,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:45:07,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:45:07,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-19 07:45:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990133311] [2022-11-19 07:45:07,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:45:07,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 07:45:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:45:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 07:45:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2022-11-19 07:45:07,403 INFO L87 Difference]: Start difference. First operand 292 states and 294 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-19 07:45:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:45:08,922 INFO L93 Difference]: Finished difference Result 641 states and 655 transitions. [2022-11-19 07:45:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-19 07:45:08,924 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-19 07:45:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:45:08,927 INFO L225 Difference]: With dead ends: 641 [2022-11-19 07:45:08,927 INFO L226 Difference]: Without dead ends: 628 [2022-11-19 07:45:08,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=864, Invalid=2796, Unknown=0, NotChecked=0, Total=3660 [2022-11-19 07:45:08,929 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 355 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:45:08,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 411 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 07:45:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-19 07:45:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2022-11-19 07:45:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 403 states have (on average 1.0049627791563276) internal successors, (405), 404 states have internal predecessors, (405), 113 states have call successors, (113), 111 states have call predecessors, (113), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-11-19 07:45:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 630 transitions. [2022-11-19 07:45:09,107 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 630 transitions. Word has length 292 [2022-11-19 07:45:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:45:09,107 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 630 transitions. [2022-11-19 07:45:09,108 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-19 07:45:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 630 transitions. [2022-11-19 07:45:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2022-11-19 07:45:09,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:45:09,123 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-19 07:45:09,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 07:45:09,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:09,329 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:45:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:45:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1500193707, now seen corresponding path program 4 times [2022-11-19 07:45:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:45:09,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481797271] [2022-11-19 07:45:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:45:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:45:09,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:45:09,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113191960] [2022-11-19 07:45:09,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:45:09,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:45:09,352 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:45:09,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 07:45:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:45:09,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-19 07:45:09,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:45:10,877 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-19 07:45:10,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:45:12,298 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-19 07:45:12,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:45:12,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481797271] [2022-11-19 07:45:12,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:45:12,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113191960] [2022-11-19 07:45:12,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113191960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:45:12,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378605722] [2022-11-19 07:45:12,301 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:45:12,301 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:45:12,301 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:45:12,301 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:45:12,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:45:15,309 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:45:15,316 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:45:16,443 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18789#(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-19 07:45:16,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:45:16,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:45:16,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-19 07:45:16,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499879940] [2022-11-19 07:45:16,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:45:16,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-19 07:45:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:45:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-19 07:45:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=2831, Unknown=0, NotChecked=0, Total=4032 [2022-11-19 07:45:16,449 INFO L87 Difference]: Start difference. First operand 628 states and 630 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-19 07:45:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:45:20,150 INFO L93 Difference]: Finished difference Result 1313 states and 1339 transitions. [2022-11-19 07:45:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-19 07:45:20,151 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-19 07:45:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:45:20,157 INFO L225 Difference]: With dead ends: 1313 [2022-11-19 07:45:20,157 INFO L226 Difference]: Without dead ends: 1300 [2022-11-19 07:45:20,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1927 GetRequests, 1820 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3384, Invalid=8388, Unknown=0, NotChecked=0, Total=11772 [2022-11-19 07:45:20,161 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 595 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:45:20,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 747 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 07:45:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-11-19 07:45:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2022-11-19 07:45:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 835 states have (on average 1.0023952095808384) internal successors, (837), 836 states have internal predecessors, (837), 233 states have call successors, (233), 231 states have call predecessors, (233), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-11-19 07:45:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1302 transitions. [2022-11-19 07:45:20,603 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1302 transitions. Word has length 628 [2022-11-19 07:45:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:45:20,605 INFO L495 AbstractCegarLoop]: Abstraction has 1300 states and 1302 transitions. [2022-11-19 07:45:20,605 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-19 07:45:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1302 transitions. [2022-11-19 07:45:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2022-11-19 07:45:20,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:45:20,624 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-19 07:45:20,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 07:45:20,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:20,831 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:45:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:45:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 622252005, now seen corresponding path program 5 times [2022-11-19 07:45:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:45:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924806551] [2022-11-19 07:45:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:45:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:45:20,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:45:20,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328300515] [2022-11-19 07:45:20,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:45:20,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:20,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:45:20,883 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:45:20,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 07:45:23,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 162 check-sat command(s) [2022-11-19 07:45:23,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:45:23,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-19 07:45:23,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:45:26,621 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-19 07:45:26,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:45:30,780 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-19 07:45:30,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:45:30,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924806551] [2022-11-19 07:45:30,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:45:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328300515] [2022-11-19 07:45:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328300515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:45:30,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [621836800] [2022-11-19 07:45:30,788 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:45:30,788 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:45:30,789 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:45:30,789 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:45:30,790 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:45:33,433 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:45:33,437 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:45:36,799 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30425#(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-19 07:45:36,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:45:36,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:45:36,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-19 07:45:36,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643820593] [2022-11-19 07:45:36,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:45:36,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-19 07:45:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:45:36,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-19 07:45:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4633, Invalid=7799, Unknown=0, NotChecked=0, Total=12432 [2022-11-19 07:45:36,809 INFO L87 Difference]: Start difference. First operand 1300 states and 1302 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-19 07:45:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:45:48,869 INFO L93 Difference]: Finished difference Result 2657 states and 2707 transitions. [2022-11-19 07:45:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-19 07:45:48,871 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-19 07:45:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:45:48,883 INFO L225 Difference]: With dead ends: 2657 [2022-11-19 07:45:48,884 INFO L226 Difference]: Without dead ends: 2644 [2022-11-19 07:45:48,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3991 GetRequests, 3788 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8283 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=13608, Invalid=28212, Unknown=0, NotChecked=0, Total=41820 [2022-11-19 07:45:48,892 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 1114 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 4181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:45:48,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1445 Invalid, 4181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-19 07:45:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2022-11-19 07:45:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2022-11-19 07:45:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 1699 states have (on average 1.0011771630370807) internal successors, (1701), 1700 states have internal predecessors, (1701), 473 states have call successors, (473), 471 states have call predecessors, (473), 471 states have return successors, (472), 472 states have call predecessors, (472), 472 states have call successors, (472) [2022-11-19 07:45:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 2646 transitions. [2022-11-19 07:45:49,720 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 2646 transitions. Word has length 1300 [2022-11-19 07:45:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:45:49,722 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 2646 transitions. [2022-11-19 07:45:49,724 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-19 07:45:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 2646 transitions. [2022-11-19 07:45:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2645 [2022-11-19 07:45:49,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:45:49,793 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-19 07:45:49,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-19 07:45:50,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:50,008 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:45:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:45:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1606219525, now seen corresponding path program 6 times [2022-11-19 07:45:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:45:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247022492] [2022-11-19 07:45:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:45:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:45:50,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:45:50,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099285512] [2022-11-19 07:45:50,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:45:50,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:45:50,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:45:50,115 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:45:50,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-19 07:45:52,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:45:52,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:45:52,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 5606 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-19 07:45:52,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:46:01,024 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-19 07:46:01,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:46:07,773 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-19 07:46:07,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:46:07,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247022492] [2022-11-19 07:46:07,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:46:07,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099285512] [2022-11-19 07:46:07,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099285512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:46:07,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277501388] [2022-11-19 07:46:07,776 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:46:07,776 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:46:07,777 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:46:07,777 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:46:07,777 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:46:10,212 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-19 07:46:10,216 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:46:18,613 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '53971#(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-19 07:46:18,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:46:18,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:46:18,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-19 07:46:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906994372] [2022-11-19 07:46:18,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:46:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-19 07:46:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:46:18,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-19 07:46:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5224, Invalid=8582, Unknown=0, NotChecked=0, Total=13806 [2022-11-19 07:46:18,624 INFO L87 Difference]: Start difference. First operand 2644 states and 2646 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-19 07:46:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:46:29,532 INFO L93 Difference]: Finished difference Result 2825 states and 2833 transitions. [2022-11-19 07:46:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-19 07:46:29,536 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-19 07:46:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:46:29,550 INFO L225 Difference]: With dead ends: 2825 [2022-11-19 07:46:29,550 INFO L226 Difference]: Without dead ends: 2812 [2022-11-19 07:46:29,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8029 GetRequests, 7724 SyntacticMatches, 90 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11886 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=15417, Invalid=31455, Unknown=0, NotChecked=0, Total=46872 [2022-11-19 07:46:29,556 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 616 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 965 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 965 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:46:29,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2045 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [965 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-19 07:46:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-11-19 07:46:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2022-11-19 07:46:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 1807 states have (on average 1.0011068068622024) internal successors, (1809), 1808 states have internal predecessors, (1809), 503 states have call successors, (503), 501 states have call predecessors, (503), 501 states have return successors, (502), 502 states have call predecessors, (502), 502 states have call successors, (502) [2022-11-19 07:46:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 2814 transitions. [2022-11-19 07:46:30,658 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 2814 transitions. Word has length 2644 [2022-11-19 07:46:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:46:30,662 INFO L495 AbstractCegarLoop]: Abstraction has 2812 states and 2814 transitions. [2022-11-19 07:46:30,664 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-19 07:46:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 2814 transitions. [2022-11-19 07:46:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2813 [2022-11-19 07:46:30,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:46:30,738 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-19 07:46:30,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-19 07:46:30,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 07:46:30,946 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:46:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:46:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash -301534743, now seen corresponding path program 7 times [2022-11-19 07:46:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:46:30,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12508808] [2022-11-19 07:46:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:46:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:46:31,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:46:31,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932999371] [2022-11-19 07:46:31,051 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:46:31,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:46:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:46:31,052 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:46:31,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 07:46:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:46:32,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:46:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:46:35,269 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:46:35,269 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:46:35,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 07:46:35,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-19 07:46:35,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:46:35,502 INFO L444 BasicCegarLoop]: Path program histogram: [7, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:46:35,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:46:35,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:46:35 BoogieIcfgContainer [2022-11-19 07:46:35,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:46:35,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:46:35,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:46:35,958 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:46:35,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:09" (3/4) ... [2022-11-19 07:46:35,960 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:46:36,507 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:46:36,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:46:36,508 INFO L158 Benchmark]: Toolchain (without parser) took 388072.95ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 62.1MB in the beginning and 833.8MB in the end (delta: -771.8MB). Peak memory consumption was 216.0MB. Max. memory is 16.1GB. [2022-11-19 07:46:36,508 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 67.4MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:46:36,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.19ms. Allocated memory is still 96.5MB. Free memory was 61.9MB in the beginning and 71.8MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 07:46:36,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.93ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:46:36,514 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 69.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:46:36,514 INFO L158 Benchmark]: RCFGBuilder took 477.40ms. Allocated memory is still 96.5MB. Free memory was 69.0MB in the beginning and 56.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:46:36,515 INFO L158 Benchmark]: TraceAbstraction took 386678.18ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 56.1MB in the beginning and 913.5MB in the end (delta: -857.5MB). Peak memory consumption was 653.0MB. Max. memory is 16.1GB. [2022-11-19 07:46:36,515 INFO L158 Benchmark]: Witness Printer took 549.52ms. Allocated memory is still 1.1GB. Free memory was 913.5MB in the beginning and 833.8MB in the end (delta: 79.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-11-19 07:46:36,525 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.27ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 67.4MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.19ms. Allocated memory is still 96.5MB. Free memory was 61.9MB in the beginning and 71.8MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.93ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 69.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.40ms. Allocated memory is still 96.5MB. Free memory was 69.0MB in the beginning and 56.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 386678.18ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 56.1MB in the beginning and 913.5MB in the end (delta: -857.5MB). Peak memory consumption was 653.0MB. Max. memory is 16.1GB. * Witness Printer took 549.52ms. Allocated memory is still 1.1GB. Free memory was 913.5MB in the beginning and 833.8MB in the end (delta: 79.7MB). 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: 386.1s, OverallIterations: 23, TraceHistogramMax: 502, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 59.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 3181 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3125 mSDsluCounter, 6575 SdHoareTripleChecker+Invalid, 30.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 406 IncrementalHoareTripleChecker+Unchecked, 4599 mSDsCounter, 4121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9615 IncrementalHoareTripleChecker+Invalid, 14147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4121 mSolverCounterUnsat, 1976 mSDtfsCounter, 9615 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17320 GetRequests, 16203 SyntacticMatches, 167 SemanticMatches, 950 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27306 ImplicationChecksByTransitivity, 171.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2812occurred in iteration=22, InterpolantAutomatonStates: 698, 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, 22 MinimizatonAttempts, 57 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 171.3s InterpolantComputationTime, 8524 NumberOfCodeBlocks, 8386 NumberOfCodeBlocksAsserted, 200 NumberOfCheckSat, 11326 ConstructedInterpolants, 4 QuantifiedInterpolants, 31902 SizeOfPredicates, 222 NumberOfNonLiveVariables, 12331 ConjunctsInSsa, 678 ConjunctsInUnsatCore, 40 InterpolantComputations, 3 PerfectInterpolantSequences, 598892/1259974 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: 2.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 98, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 62, TOOLS_POST_TIME: 0.3s, TOOLS_POST_CALL_APPLICATIONS: 78, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 48, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 188, TOOLS_QUANTIFIERELIM_TIME: 1.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 238, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 104, DOMAIN_JOIN_TIME: 0.7s, 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: 98, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 48, CALL_SUMMARIZER_CACHE_MISSES: 6, 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: 852, DAG_COMPRESSION_RETAINED_NODES: 262, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 07:46:36,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70a6a975-78a8-42e6-b1a5-d91badf7abc6/bin/utaipan-I9t0OCRTmS/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