./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 4e7fbc69 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_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/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_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 14:23:32,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:23:32,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:23:32,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:23:32,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:23:32,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:23:32,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:23:32,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:23:32,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:23:32,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:23:32,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:23:32,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:23:32,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:23:32,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:23:32,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:23:32,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:23:32,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:23:32,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:23:32,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:23:32,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:23:32,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:23:32,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:23:32,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:23:32,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:23:32,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:23:32,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:23:32,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:23:32,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:23:32,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:23:32,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:23:32,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:23:32,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:23:32,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:23:32,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:23:32,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:23:32,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:23:32,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:23:32,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:23:32,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:23:32,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:23:32,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:23:32,211 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:23:32,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:23:32,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:23:32,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:23:32,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:23:32,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:23:32,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:23:32,251 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:23:32,251 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:23:32,251 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:23:32,251 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:23:32,251 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:23:32,252 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:23:32,252 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:23:32,252 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:23:32,252 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:23:32,252 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:23:32,252 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:23:32,253 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:23:32,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:23:32,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:23:32,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:23:32,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:23:32,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:23:32,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:23:32,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:23:32,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:23:32,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:23:32,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:23:32,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:23:32,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:23:32,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:23:32,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:23:32,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:23:32,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:23:32,256 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:23:32,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:23:32,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:23:32,257 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:23:32,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:23:32,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:23:32,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:23:32,257 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_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/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_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW 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-23 14:23:32,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:23:32,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:23:32,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:23:32,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:23:32,594 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:23:32,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-11-23 14:23:35,658 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:23:35,914 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:23:35,915 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c [2022-11-23 14:23:35,924 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/data/298908265/f73576e1579440bb864e95663a3de98f/FLAG861d96057 [2022-11-23 14:23:35,942 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/data/298908265/f73576e1579440bb864e95663a3de98f [2022-11-23 14:23:35,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:23:35,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:23:35,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:23:35,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:23:35,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:23:35,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:23:35" (1/1) ... [2022-11-23 14:23:35,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dd1ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:35, skipping insertion in model container [2022-11-23 14:23:35,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:23:35" (1/1) ... [2022-11-23 14:23:35,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:23:36,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:23:36,201 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-11-23 14:23:36,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:23:36,236 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:23:36,248 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound100.c[588,601] [2022-11-23 14:23:36,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:23:36,271 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:23:36,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36 WrapperNode [2022-11-23 14:23:36,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:23:36,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:23:36,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:23:36,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:23:36,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,309 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-11-23 14:23:36,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:23:36,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:23:36,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:23:36,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:23:36,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,334 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:23:36,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:23:36,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:23:36,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:23:36,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (1/1) ... [2022-11-23 14:23:36,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:23:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:23:36,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:23:36,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:23:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:23:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:23:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:23:36,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:23:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 14:23:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 14:23:36,481 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:23:36,483 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:23:36,651 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:23:36,670 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:23:36,670 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 14:23:36,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:36 BoogieIcfgContainer [2022-11-23 14:23:36,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:23:36,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:23:36,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:23:36,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:23:36,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:23:35" (1/3) ... [2022-11-23 14:23:36,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2255536b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:23:36, skipping insertion in model container [2022-11-23 14:23:36,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:36" (2/3) ... [2022-11-23 14:23:36,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2255536b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:23:36, skipping insertion in model container [2022-11-23 14:23:36,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:36" (3/3) ... [2022-11-23 14:23:36,684 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound100.c [2022-11-23 14:23:36,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:23:36,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 14:23:36,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:23:36,758 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;@651b3ade, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:23:36,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 14:23:36,762 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-23 14:23:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:23:36,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:36,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:23:36,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:36,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1408153759, now seen corresponding path program 1 times [2022-11-23 14:23:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:36,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429214885] [2022-11-23 14:23:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:36,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:36,999 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-23 14:23:37,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429214885] [2022-11-23 14:23:37,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429214885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:23:37,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:23:37,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:23:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346831591] [2022-11-23 14:23:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:23:37,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 14:23:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:23:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 14:23:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:23:37,055 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-23 14:23:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:23:37,087 INFO L93 Difference]: Finished difference Result 45 states and 82 transitions. [2022-11-23 14:23:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 14:23:37,090 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-23 14:23:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:23:37,098 INFO L225 Difference]: With dead ends: 45 [2022-11-23 14:23:37,098 INFO L226 Difference]: Without dead ends: 21 [2022-11-23 14:23:37,102 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-23 14:23:37,109 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-23 14:23:37,111 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-23 14:23:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-23 14:23:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-23 14:23:37,154 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-23 14:23:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2022-11-23 14:23:37,157 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 6 [2022-11-23 14:23:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:23:37,158 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2022-11-23 14:23:37,158 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-23 14:23:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2022-11-23 14:23:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:23:37,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:37,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:23:37,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:23:37,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1232571916, now seen corresponding path program 1 times [2022-11-23 14:23:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:37,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987108955] [2022-11-23 14:23:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:37,339 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-23 14:23:37,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:37,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987108955] [2022-11-23 14:23:37,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987108955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:23:37,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:23:37,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:23:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025622685] [2022-11-23 14:23:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:23:37,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:23:37,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:23:37,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:23:37,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:23:37,344 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-23 14:23:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:23:37,370 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2022-11-23 14:23:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:23:37,371 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-23 14:23:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:23:37,372 INFO L225 Difference]: With dead ends: 35 [2022-11-23 14:23:37,372 INFO L226 Difference]: Without dead ends: 23 [2022-11-23 14:23:37,373 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-23 14:23:37,374 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-23 14:23:37,375 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-23 14:23:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-23 14:23:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-23 14:23:37,382 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-23 14:23:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2022-11-23 14:23:37,383 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 7 [2022-11-23 14:23:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:23:37,384 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-11-23 14:23:37,384 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-23 14:23:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-11-23 14:23:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:23:37,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:37,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:23:37,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:23:37,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:37,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1231022784, now seen corresponding path program 1 times [2022-11-23 14:23:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:37,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877593521] [2022-11-23 14:23:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:37,638 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-23 14:23:37,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877593521] [2022-11-23 14:23:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877593521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:23:37,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:23:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:23:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141436557] [2022-11-23 14:23:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:23:37,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:23:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:23:37,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:23:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:23:37,642 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-23 14:23:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:23:37,756 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-23 14:23:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:23:37,761 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-23 14:23:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:23:37,762 INFO L225 Difference]: With dead ends: 29 [2022-11-23 14:23:37,762 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 14:23:37,762 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-23 14:23:37,764 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-23 14:23:37,764 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-23 14:23:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 14:23:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 14:23:37,783 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-23 14:23:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-23 14:23:37,791 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2022-11-23 14:23:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:23:37,792 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-23 14:23:37,792 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-23 14:23:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-11-23 14:23:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:23:37,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:37,794 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:23:37,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:23:37,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1004679035, now seen corresponding path program 1 times [2022-11-23 14:23:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:37,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621792866] [2022-11-23 14:23:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:37,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:23:37,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044378048] [2022-11-23 14:23:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:23:37,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:23:37,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:23:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:37,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 14:23:37,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:23:38,168 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-23 14:23:38,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:38,396 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-23 14:23:38,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:38,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621792866] [2022-11-23 14:23:38,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:23:38,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044378048] [2022-11-23 14:23:38,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044378048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:23:38,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1979619432] [2022-11-23 14:23:38,417 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-23 14:23:38,417 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:23:38,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:23:38,426 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:23:38,427 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:23:38,665 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-23 14:23:38,686 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:23:39,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1979619432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:23:39,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:23:39,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2022-11-23 14:23:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781554274] [2022-11-23 14:23:39,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:23:39,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:23:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:23:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:23:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-23 14:23:39,111 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-23 14:23:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:23:39,453 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-11-23 14:23:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:23:39,454 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-23 14:23:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:23:39,455 INFO L225 Difference]: With dead ends: 49 [2022-11-23 14:23:39,455 INFO L226 Difference]: Without dead ends: 41 [2022-11-23 14:23:39,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-23 14:23:39,457 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:23:39,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:23:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-23 14:23:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-23 14:23:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 14:23:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-11-23 14:23:39,476 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 12 [2022-11-23 14:23:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:23:39,476 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-11-23 14:23:39,477 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-23 14:23:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-11-23 14:23:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 14:23:39,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:39,478 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-23 14:23:39,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:23:39,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:39,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash 204620983, now seen corresponding path program 1 times [2022-11-23 14:23:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:39,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603283133] [2022-11-23 14:23:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:39,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:23:39,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832837726] [2022-11-23 14:23:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:23:39,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:23:39,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:23:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:39,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:23:39,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:23:39,843 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-23 14:23:39,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:39,900 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-23 14:23:39,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:39,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603283133] [2022-11-23 14:23:39,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:23:39,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832837726] [2022-11-23 14:23:39,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832837726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:23:39,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1702347946] [2022-11-23 14:23:39,904 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:23:39,905 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:23:39,905 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:23:39,905 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:23:39,906 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:23:44,449 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:23:44,455 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:23:45,406 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '790#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:23:45,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:23:45,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:23:45,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-23 14:23:45,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755501672] [2022-11-23 14:23:45,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:23:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:23:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:23:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:23:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:23:45,408 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-23 14:23:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:23:45,603 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2022-11-23 14:23:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 14:23:45,604 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-23 14:23:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:23:45,606 INFO L225 Difference]: With dead ends: 107 [2022-11-23 14:23:45,606 INFO L226 Difference]: Without dead ends: 91 [2022-11-23 14:23:45,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-11-23 14:23:45,608 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 56 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:23:45,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 232 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:23:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-23 14:23:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-11-23 14:23:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 14:23:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2022-11-23 14:23:45,633 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 40 [2022-11-23 14:23:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:23:45,634 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2022-11-23 14:23:45,634 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-23 14:23:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2022-11-23 14:23:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 14:23:45,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:45,636 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-23 14:23:45,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 14:23:45,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:45,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 696736299, now seen corresponding path program 1 times [2022-11-23 14:23:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:45,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432425932] [2022-11-23 14:23:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:45,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:23:45,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866327804] [2022-11-23 14:23:45,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:45,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:45,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:23:45,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:23:45,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:23:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:23:45,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 14:23:45,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:23:46,056 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-23 14:23:46,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:46,225 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-23 14:23:46,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:46,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432425932] [2022-11-23 14:23:46,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:23:46,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866327804] [2022-11-23 14:23:46,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866327804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:23:46,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203122531] [2022-11-23 14:23:46,228 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:23:46,229 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:23:46,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:23:46,229 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:23:46,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:23:49,224 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-23 14:23:49,262 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:23:51,775 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1361#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:23:51,775 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:23:51,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:23:51,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-23 14:23:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737913241] [2022-11-23 14:23:51,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:23:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 14:23:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:23:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 14:23:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-11-23 14:23:51,778 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-23 14:23:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:23:52,497 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2022-11-23 14:23:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:23:52,498 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-23 14:23:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:23:52,500 INFO L225 Difference]: With dead ends: 105 [2022-11-23 14:23:52,500 INFO L226 Difference]: Without dead ends: 103 [2022-11-23 14:23:52,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:23:52,501 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:23:52,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 61 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:23:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-23 14:23:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-23 14:23:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 14:23:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2022-11-23 14:23:52,529 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 40 [2022-11-23 14:23:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:23:52,529 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2022-11-23 14:23:52,530 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-23 14:23:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-11-23 14:23:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 14:23:52,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:23:52,531 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-23 14:23:52,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:23:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:52,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:23:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:23:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1539244486, now seen corresponding path program 2 times [2022-11-23 14:23:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:23:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099199531] [2022-11-23 14:23:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:23:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:23:52,751 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:23:52,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650278822] [2022-11-23 14:23:52,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:23:52,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:23:52,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:23:52,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:23:52,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:23:52,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:23:52,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:23:52,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 14:23:52,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:23:52,899 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-23 14:23:52,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:23:52,982 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-23 14:23:52,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:23:52,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099199531] [2022-11-23 14:23:52,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:23:52,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650278822] [2022-11-23 14:23:52,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650278822] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:23:52,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581227464] [2022-11-23 14:23:52,985 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:23:52,985 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:23:52,985 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:23:52,985 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:23:52,985 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:23:55,936 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-23 14:23:55,983 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:02,907 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1973#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:02,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:02,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:02,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 14:24:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843870566] [2022-11-23 14:24:02,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:02,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:24:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:24:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:24:02,910 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-23 14:24:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:03,111 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-11-23 14:24:03,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:24:03,114 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-23 14:24:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:03,119 INFO L225 Difference]: With dead ends: 117 [2022-11-23 14:24:03,119 INFO L226 Difference]: Without dead ends: 115 [2022-11-23 14:24:03,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-11-23 14:24:03,122 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:03,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:24:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-23 14:24:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-23 14:24:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 64 states have internal predecessors, (68), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-23 14:24:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-11-23 14:24:03,185 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 45 [2022-11-23 14:24:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:03,188 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-11-23 14:24:03,189 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-23 14:24:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-11-23 14:24:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 14:24:03,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:03,191 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-23 14:24:03,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:03,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:03,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash -375151797, now seen corresponding path program 3 times [2022-11-23 14:24:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:03,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397485005] [2022-11-23 14:24:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:03,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:24:03,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473096225] [2022-11-23 14:24:03,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:24:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:03,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:03,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:03,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:24:03,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:24:03,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:03,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 14:24:03,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:03,681 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-23 14:24:03,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:04,418 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-23 14:24:04,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:04,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397485005] [2022-11-23 14:24:04,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:24:04,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473096225] [2022-11-23 14:24:04,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473096225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:04,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [903341959] [2022-11-23 14:24:04,424 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:24:04,425 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:04,425 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:04,425 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:04,425 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:07,684 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:24:07,689 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:08,668 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2643#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:08,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:08,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:08,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-23 14:24:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216708296] [2022-11-23 14:24:08,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:08,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:24:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:24:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-11-23 14:24:08,670 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-23 14:24:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:09,734 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2022-11-23 14:24:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:24:09,735 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-23 14:24:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:09,736 INFO L225 Difference]: With dead ends: 141 [2022-11-23 14:24:09,736 INFO L226 Difference]: Without dead ends: 130 [2022-11-23 14:24:09,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:24:09,738 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:09,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 72 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 14:24:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-23 14:24:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-23 14:24:09,765 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-23 14:24:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-11-23 14:24:09,766 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 50 [2022-11-23 14:24:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:09,766 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-11-23 14:24:09,767 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-23 14:24:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-11-23 14:24:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 14:24:09,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:09,768 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-23 14:24:09,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:09,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-23 14:24:09,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 780075682, now seen corresponding path program 1 times [2022-11-23 14:24:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:09,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090578560] [2022-11-23 14:24:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:09,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:24:09,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767483397] [2022-11-23 14:24:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:10,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:10,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:24:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:10,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 14:24:10,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:10,693 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-23 14:24:10,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:11,019 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-23 14:24:11,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:11,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090578560] [2022-11-23 14:24:11,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:24:11,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767483397] [2022-11-23 14:24:11,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767483397] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:11,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206031039] [2022-11-23 14:24:11,024 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:24:11,024 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:11,024 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:11,025 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:11,025 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:14,472 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:24:14,476 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:15,663 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3455#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:15,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:15,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:15,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-23 14:24:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34407335] [2022-11-23 14:24:15,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:15,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:24:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:15,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:24:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-11-23 14:24:15,666 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-23 14:24:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:16,311 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-23 14:24:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:24:16,311 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-23 14:24:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:16,314 INFO L225 Difference]: With dead ends: 146 [2022-11-23 14:24:16,314 INFO L226 Difference]: Without dead ends: 142 [2022-11-23 14:24:16,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 14:24:16,315 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:16,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 53 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:24:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-23 14:24:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-23 14:24:16,354 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-23 14:24:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2022-11-23 14:24:16,357 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 66 [2022-11-23 14:24:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:16,358 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2022-11-23 14:24:16,358 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-23 14:24:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2022-11-23 14:24:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 14:24:16,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:16,367 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-23 14:24:16,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:16,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 14:24:16,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1686864157, now seen corresponding path program 1 times [2022-11-23 14:24:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:16,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428152591] [2022-11-23 14:24:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:16,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:24:16,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476776970] [2022-11-23 14:24:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:16,584 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:16,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:24:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:16,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 14:24:16,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:16,855 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-23 14:24:16,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:17,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:17,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428152591] [2022-11-23 14:24:17,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:24:17,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476776970] [2022-11-23 14:24:17,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476776970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:17,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [398598040] [2022-11-23 14:24:17,117 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-23 14:24:17,117 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:17,118 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:17,118 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:17,118 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:19,696 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-23 14:24:19,733 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:22,983 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4244#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:22,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:22,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:22,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-11-23 14:24:22,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693927233] [2022-11-23 14:24:22,984 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:22,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:24:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:24:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-11-23 14:24:22,986 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-23 14:24:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:23,378 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2022-11-23 14:24:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:24:23,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 71 [2022-11-23 14:24:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:23,380 INFO L225 Difference]: With dead ends: 144 [2022-11-23 14:24:23,380 INFO L226 Difference]: Without dead ends: 133 [2022-11-23 14:24:23,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-11-23 14:24:23,382 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:23,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 56 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:24:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-23 14:24:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-23 14:24:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 85 states have internal predecessors, (87), 28 states have call successors, (28), 22 states have call predecessors, (28), 22 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-23 14:24:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-11-23 14:24:23,419 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 71 [2022-11-23 14:24:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:23,419 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-11-23 14:24:23,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-23 14:24:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-11-23 14:24:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 14:24:23,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:23,421 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-23 14:24:23,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:23,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 14:24:23,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash -226115244, now seen corresponding path program 4 times [2022-11-23 14:24:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:23,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437941535] [2022-11-23 14:24:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:23,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:24:23,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481598515] [2022-11-23 14:24:23,635 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:24:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:23,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:23,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:24:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:23,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-23 14:24:23,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:23,974 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-23 14:24:23,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:24,331 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-23 14:24:24,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:24,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437941535] [2022-11-23 14:24:24,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:24:24,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481598515] [2022-11-23 14:24:24,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481598515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:24,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335966158] [2022-11-23 14:24:24,334 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:24:24,334 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:24,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:24,334 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:24,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:26,755 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-23 14:24:26,789 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:31,267 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5105#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:31,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:31,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:31,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-23 14:24:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879488810] [2022-11-23 14:24:31,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:31,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:24:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:24:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:24:31,270 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 9 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2022-11-23 14:24:34,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-23 14:24:37,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-23 14:24:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:37,060 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2022-11-23 14:24:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 14:24:37,060 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-23 14:24:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:37,062 INFO L225 Difference]: With dead ends: 158 [2022-11-23 14:24:37,062 INFO L226 Difference]: Without dead ends: 154 [2022-11-23 14:24:37,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 14:24:37,063 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:37,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 104 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 567 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-11-23 14:24:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-23 14:24:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2022-11-23 14:24:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 89 states have internal predecessors, (91), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-23 14:24:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2022-11-23 14:24:37,114 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 73 [2022-11-23 14:24:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:37,115 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2022-11-23 14:24:37,115 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-23 14:24:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-11-23 14:24:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 14:24:37,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:37,117 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:37,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:37,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:37,335 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1857500541, now seen corresponding path program 2 times [2022-11-23 14:24:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:37,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508604597] [2022-11-23 14:24:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:37,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:24:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689245222] [2022-11-23 14:24:37,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:24:37,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:37,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:37,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:37,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:24:37,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:24:37,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:37,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 14:24:37,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 107 proven. 41 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-11-23 14:24:38,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 107 proven. 41 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-11-23 14:24:39,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:39,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508604597] [2022-11-23 14:24:39,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:24:39,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689245222] [2022-11-23 14:24:39,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689245222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:39,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301873630] [2022-11-23 14:24:39,858 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-23 14:24:39,858 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:39,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:39,859 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:39,859 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:43,214 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:24:43,219 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:44,965 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6163#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:44,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:44,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:24:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-11-23 14:24:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628249845] [2022-11-23 14:24:44,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 14:24:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 14:24:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:24:44,968 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2022-11-23 14:24:54,712 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-23 14:24:56,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-23 14:24:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:56,638 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2022-11-23 14:24:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 14:24:56,639 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 99 [2022-11-23 14:24:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:56,640 INFO L225 Difference]: With dead ends: 177 [2022-11-23 14:24:56,640 INFO L226 Difference]: Without dead ends: 157 [2022-11-23 14:24:56,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 14:24:56,647 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:56,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 108 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 717 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-11-23 14:24:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-23 14:24:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2022-11-23 14:24:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 92 states have internal predecessors, (94), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-23 14:24:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2022-11-23 14:24:56,742 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 99 [2022-11-23 14:24:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:56,743 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2022-11-23 14:24:56,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 10 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2022-11-23 14:24:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2022-11-23 14:24:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-23 14:24:56,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:56,744 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-23 14:24:56,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:56,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:56,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:56,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2067588009, now seen corresponding path program 2 times [2022-11-23 14:24:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932694564] [2022-11-23 14:24:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:56,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:24:56,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084679078] [2022-11-23 14:24:56,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:24:56,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:56,960 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:56,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 14:24:57,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-23 14:24:57,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:57,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 14:24:57,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:57,272 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-23 14:24:57,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:57,444 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-23 14:24:57,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:57,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932694564] [2022-11-23 14:24:57,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:24:57,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084679078] [2022-11-23 14:24:57,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084679078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:57,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [844419781] [2022-11-23 14:24:57,446 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:24:57,446 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:57,446 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:57,447 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:57,447 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:59,931 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:24:59,935 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:25:02,422 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7434#(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-23 14:25:02,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:25:02,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:25:02,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-23 14:25:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034661380] [2022-11-23 14:25:02,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:25:02,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:25:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:25:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:25:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2022-11-23 14:25:02,425 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-11-23 14:25:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:03,047 INFO L93 Difference]: Finished difference Result 352 states and 366 transitions. [2022-11-23 14:25:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 14:25:03,047 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-23 14:25:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:03,050 INFO L225 Difference]: With dead ends: 352 [2022-11-23 14:25:03,050 INFO L226 Difference]: Without dead ends: 331 [2022-11-23 14:25:03,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 14:25:03,051 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 97 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:03,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 326 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:25:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-23 14:25:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 309. [2022-11-23 14:25:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 195 states have (on average 1.0307692307692307) internal successors, (201), 199 states have internal predecessors, (201), 60 states have call successors, (60), 54 states have call predecessors, (60), 53 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2022-11-23 14:25:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 319 transitions. [2022-11-23 14:25:03,145 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 319 transitions. Word has length 124 [2022-11-23 14:25:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:03,146 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 319 transitions. [2022-11-23 14:25:03,147 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-23 14:25:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 319 transitions. [2022-11-23 14:25:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-23 14:25:03,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:03,149 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 37, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:25:03,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:03,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 14:25:03,355 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:25:03,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash 426484197, now seen corresponding path program 3 times [2022-11-23 14:25:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:25:03,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530556765] [2022-11-23 14:25:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:25:03,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:25:03,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275438796] [2022-11-23 14:25:03,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:25:03,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:03,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:03,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:25:03,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 14:25:05,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:25:05,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:25:05,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-23 14:25:05,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 613 proven. 562 refuted. 0 times theorem prover too weak. 1731 trivial. 0 not checked. [2022-11-23 14:25:07,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:25:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2906 backedges. 404 proven. 24 refuted. 0 times theorem prover too weak. 2478 trivial. 0 not checked. [2022-11-23 14:25:10,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:25:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530556765] [2022-11-23 14:25:10,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:25:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275438796] [2022-11-23 14:25:10,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275438796] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:25:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1361984254] [2022-11-23 14:25:10,275 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-23 14:25:10,275 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:25:10,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:25:10,276 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:25:10,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:25:12,860 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-23 14:25:12,900 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:25:22,205 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9677#(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-23 14:25:22,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:25:22,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:25:22,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 25 [2022-11-23 14:25:22,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107587299] [2022-11-23 14:25:22,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:25:22,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 14:25:22,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:25:22,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 14:25:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 14:25:22,209 INFO L87 Difference]: Start difference. First operand 309 states and 319 transitions. Second operand has 25 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 18 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 16 states have call predecessors, (46), 18 states have call successors, (46) [2022-11-23 14:25:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:25,344 INFO L93 Difference]: Finished difference Result 316 states and 325 transitions. [2022-11-23 14:25:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 14:25:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 18 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 16 states have call predecessors, (46), 18 states have call successors, (46) Word has length 211 [2022-11-23 14:25:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:25,347 INFO L225 Difference]: With dead ends: 316 [2022-11-23 14:25:25,347 INFO L226 Difference]: Without dead ends: 289 [2022-11-23 14:25:25,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 592 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=303, Invalid=1589, Unknown=0, NotChecked=0, Total=1892 [2022-11-23 14:25:25,349 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:25,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 74 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-23 14:25:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-23 14:25:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-11-23 14:25:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 186 states have (on average 1.0053763440860215) internal successors, (187), 186 states have internal predecessors, (187), 52 states have call successors, (52), 51 states have call predecessors, (52), 50 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-23 14:25:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2022-11-23 14:25:25,444 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 211 [2022-11-23 14:25:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:25,445 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2022-11-23 14:25:25,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 18 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 16 states have call predecessors, (46), 18 states have call successors, (46) [2022-11-23 14:25:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2022-11-23 14:25:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-23 14:25:25,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:25,449 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-23 14:25:25,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:25,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 14:25:25,661 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:25:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:25,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1818744179, now seen corresponding path program 3 times [2022-11-23 14:25:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:25:25,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312866504] [2022-11-23 14:25:25,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:25,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:25:25,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:25:25,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088069309] [2022-11-23 14:25:25,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:25:25,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:25,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:25,677 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:25:25,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 14:25:25,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:25:25,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:25:25,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 14:25:25,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:26,353 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-23 14:25:26,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:25:26,804 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-23 14:25:26,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:25:26,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312866504] [2022-11-23 14:25:26,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:25:26,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088069309] [2022-11-23 14:25:26,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088069309] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:25:26,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1851324470] [2022-11-23 14:25:26,806 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:25:26,807 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:25:26,807 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:25:26,807 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:25:26,807 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:25:29,210 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:25:29,215 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:25:33,082 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12319#(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-23 14:25:33,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:25:33,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:25:33,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-23 14:25:33,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778030223] [2022-11-23 14:25:33,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:25:33,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:25:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:25:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:25:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 14:25:33,085 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-11-23 14:25:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:34,381 INFO L93 Difference]: Finished difference Result 635 states and 647 transitions. [2022-11-23 14:25:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 14:25:34,382 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-23 14:25:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:34,389 INFO L225 Difference]: With dead ends: 635 [2022-11-23 14:25:34,389 INFO L226 Difference]: Without dead ends: 625 [2022-11-23 14:25:34,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=864, Invalid=2796, Unknown=0, NotChecked=0, Total=3660 [2022-11-23 14:25:34,391 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 208 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:34,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 499 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:25:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-23 14:25:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2022-11-23 14:25:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 402 states have (on average 1.0024875621890548) internal successors, (403), 402 states have internal predecessors, (403), 112 states have call successors, (112), 111 states have call predecessors, (112), 110 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-11-23 14:25:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2022-11-23 14:25:34,556 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 292 [2022-11-23 14:25:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:34,557 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2022-11-23 14:25:34,557 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-23 14:25:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2022-11-23 14:25:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2022-11-23 14:25:34,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:34,577 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-23 14:25:34,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:34,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 14:25:34,784 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:25:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1500193707, now seen corresponding path program 4 times [2022-11-23 14:25:34,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:25:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264131188] [2022-11-23 14:25:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:34,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:25:34,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:25:34,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140431899] [2022-11-23 14:25:34,812 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:25:34,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:34,813 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:25:34,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 14:25:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:25:35,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 14:25:35,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:36,263 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-23 14:25:36,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:25:37,760 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-23 14:25:37,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:25:37,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264131188] [2022-11-23 14:25:37,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:25:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140431899] [2022-11-23 14:25:37,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140431899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:25:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281390433] [2022-11-23 14:25:37,763 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:25:37,763 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:25:37,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:25:37,764 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:25:37,764 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:25:40,202 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:25:40,206 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:25:43,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17943#(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-23 14:25:43,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:25:43,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:25:43,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-23 14:25:43,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462764685] [2022-11-23 14:25:43,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:25:43,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 14:25:43,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:25:43,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 14:25:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=2831, Unknown=0, NotChecked=0, Total=4032 [2022-11-23 14:25:43,349 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand has 50 states, 50 states have (on average 4.24) internal successors, (212), 50 states have internal predecessors, (212), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-11-23 14:25:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:47,775 INFO L93 Difference]: Finished difference Result 1307 states and 1331 transitions. [2022-11-23 14:25:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-23 14:25:47,777 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-23 14:25:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:47,784 INFO L225 Difference]: With dead ends: 1307 [2022-11-23 14:25:47,784 INFO L226 Difference]: Without dead ends: 1297 [2022-11-23 14:25:47,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1927 GetRequests, 1820 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3384, Invalid=8388, Unknown=0, NotChecked=0, Total=11772 [2022-11-23 14:25:47,790 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 700 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:47,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 966 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-23 14:25:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-11-23 14:25:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2022-11-23 14:25:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 834 states have (on average 1.001199040767386) internal successors, (835), 834 states have internal predecessors, (835), 232 states have call successors, (232), 231 states have call predecessors, (232), 230 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2022-11-23 14:25:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1298 transitions. [2022-11-23 14:25:48,308 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1298 transitions. Word has length 628 [2022-11-23 14:25:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:48,310 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1298 transitions. [2022-11-23 14:25:48,311 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-23 14:25:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1298 transitions. [2022-11-23 14:25:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2022-11-23 14:25:48,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:48,330 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-23 14:25:48,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:48,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 14:25:48,538 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:25:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 622252005, now seen corresponding path program 5 times [2022-11-23 14:25:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:25:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521250978] [2022-11-23 14:25:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:25:48,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:25:48,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140821842] [2022-11-23 14:25:48,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:25:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:48,595 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:25:48,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 14:25:51,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 162 check-sat command(s) [2022-11-23 14:25:51,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:25:51,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-23 14:25:51,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:54,257 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-23 14:25:54,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:25:58,492 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-23 14:25:58,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:25:58,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521250978] [2022-11-23 14:25:58,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:25:58,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140821842] [2022-11-23 14:25:58,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140821842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:25:58,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983014675] [2022-11-23 14:25:58,495 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:25:58,496 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:25:58,496 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:25:58,496 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:25:58,496 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:26:00,958 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:26:00,965 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:26:06,484 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '29567#(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-23 14:26:06,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:26:06,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:26:06,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-23 14:26:06,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284793906] [2022-11-23 14:26:06,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:26:06,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-23 14:26:06,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-23 14:26:06,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4633, Invalid=7799, Unknown=0, NotChecked=0, Total=12432 [2022-11-23 14:26:06,495 INFO L87 Difference]: Start difference. First operand 1297 states and 1298 transitions. Second operand has 98 states, 98 states have (on average 4.36734693877551) internal successors, (428), 98 states have internal predecessors, (428), 93 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 93 states have call predecessors, (462), 93 states have call successors, (462) [2022-11-23 14:26:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:18,640 INFO L93 Difference]: Finished difference Result 2651 states and 2699 transitions. [2022-11-23 14:26:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-23 14:26:18,641 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-23 14:26:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:18,654 INFO L225 Difference]: With dead ends: 2651 [2022-11-23 14:26:18,654 INFO L226 Difference]: Without dead ends: 2641 [2022-11-23 14:26:18,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3991 GetRequests, 3788 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8283 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=13608, Invalid=28212, Unknown=0, NotChecked=0, Total=41820 [2022-11-23 14:26:18,664 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 1372 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 1777 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 4338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1777 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:18,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 1394 Invalid, 4338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1777 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-23 14:26:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2022-11-23 14:26:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2641. [2022-11-23 14:26:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 1698 states have (on average 1.0005889281507656) internal successors, (1699), 1698 states have internal predecessors, (1699), 472 states have call successors, (472), 471 states have call predecessors, (472), 470 states have return successors, (471), 471 states have call predecessors, (471), 471 states have call successors, (471) [2022-11-23 14:26:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 2642 transitions. [2022-11-23 14:26:19,654 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 2642 transitions. Word has length 1300 [2022-11-23 14:26:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:19,656 INFO L495 AbstractCegarLoop]: Abstraction has 2641 states and 2642 transitions. [2022-11-23 14:26:19,657 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-23 14:26:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 2642 transitions. [2022-11-23 14:26:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2645 [2022-11-23 14:26:19,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:19,764 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-23 14:26:19,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:19,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 14:26:19,977 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:26:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1606219525, now seen corresponding path program 6 times [2022-11-23 14:26:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530933206] [2022-11-23 14:26:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:20,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:26:20,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499664988] [2022-11-23 14:26:20,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:26:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:20,086 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:26:20,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 14:26:22,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:26:22,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:26:22,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 5606 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-23 14:26:22,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:30,524 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-23 14:26:30,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:36,960 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-23 14:26:36,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530933206] [2022-11-23 14:26:36,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:26:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499664988] [2022-11-23 14:26:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499664988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:36,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [901225579] [2022-11-23 14:26:36,963 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 14:26:36,964 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:26:36,964 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:26:36,964 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:26:36,964 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:26:39,906 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-23 14:26:39,910 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:26:41,805 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '53101#(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-23 14:26:41,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:26:41,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:26:41,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-23 14:26:41,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257432519] [2022-11-23 14:26:41,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:26:41,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-23 14:26:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-23 14:26:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5224, Invalid=8582, Unknown=0, NotChecked=0, Total=13806 [2022-11-23 14:26:41,818 INFO L87 Difference]: Start difference. First operand 2641 states and 2642 transitions. Second operand has 104 states, 104 states have (on average 5.701923076923077) internal successors, (593), 104 states have internal predecessors, (593), 100 states have call successors, (943), 96 states have call predecessors, (943), 96 states have return successors, (942), 100 states have call predecessors, (942), 100 states have call successors, (942) [2022-11-23 14:26:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:52,061 INFO L93 Difference]: Finished difference Result 2819 states and 2825 transitions. [2022-11-23 14:26:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-23 14:26:52,063 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-23 14:26:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:52,077 INFO L225 Difference]: With dead ends: 2819 [2022-11-23 14:26:52,078 INFO L226 Difference]: Without dead ends: 2809 [2022-11-23 14:26:52,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8029 GetRequests, 7724 SyntacticMatches, 90 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12098 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=15417, Invalid=31455, Unknown=0, NotChecked=0, Total=46872 [2022-11-23 14:26:52,085 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 616 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:52,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2014 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-23 14:26:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2022-11-23 14:26:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2022-11-23 14:26:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 1806 states have (on average 1.0005537098560355) internal successors, (1807), 1806 states have internal predecessors, (1807), 502 states have call successors, (502), 501 states have call predecessors, (502), 500 states have return successors, (501), 501 states have call predecessors, (501), 501 states have call successors, (501) [2022-11-23 14:26:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 2810 transitions. [2022-11-23 14:26:53,151 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 2810 transitions. Word has length 2644 [2022-11-23 14:26:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:53,153 INFO L495 AbstractCegarLoop]: Abstraction has 2809 states and 2810 transitions. [2022-11-23 14:26:53,155 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-23 14:26:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 2810 transitions. [2022-11-23 14:26:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2813 [2022-11-23 14:26:53,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:53,226 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-23 14:26:53,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-23 14:26:53,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 14:26:53,426 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:26:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash -301534743, now seen corresponding path program 7 times [2022-11-23 14:26:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:53,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808418098] [2022-11-23 14:26:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:53,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:26:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880146897] [2022-11-23 14:26:53,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:26:53,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:53,535 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:26:53,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 14:26:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:26:54,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:26:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:26:57,661 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:26:57,661 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:26:57,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 14:26:57,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:26:57,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:57,880 INFO L444 BasicCegarLoop]: Path program histogram: [7, 4, 3, 1, 1, 1, 1, 1] [2022-11-23 14:26:57,886 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:26:58,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:26:58 BoogieIcfgContainer [2022-11-23 14:26:58,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:26:58,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:26:58,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:26:58,378 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:26:58,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:36" (3/4) ... [2022-11-23 14:26:58,380 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 14:26:58,945 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:26:58,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:26:58,946 INFO L158 Benchmark]: Toolchain (without parser) took 202996.17ms. Allocated memory was 157.3MB in the beginning and 935.3MB in the end (delta: 778.0MB). Free memory was 117.8MB in the beginning and 622.0MB in the end (delta: -504.1MB). Peak memory consumption was 271.7MB. Max. memory is 16.1GB. [2022-11-23 14:26:58,946 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:26:58,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.58ms. Allocated memory is still 157.3MB. Free memory was 117.6MB in the beginning and 120.9MB in the end (delta: -3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:26:58,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 157.3MB. Free memory was 120.9MB in the beginning and 119.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:26:58,947 INFO L158 Benchmark]: Boogie Preprocessor took 27.10ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 118.5MB in the end (delta: 980.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:26:58,948 INFO L158 Benchmark]: RCFGBuilder took 335.72ms. Allocated memory is still 157.3MB. Free memory was 118.0MB in the beginning and 105.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 14:26:58,948 INFO L158 Benchmark]: TraceAbstraction took 201700.36ms. Allocated memory was 157.3MB in the beginning and 935.3MB in the end (delta: 778.0MB). Free memory was 104.9MB in the beginning and 702.0MB in the end (delta: -597.1MB). Peak memory consumption was 554.5MB. Max. memory is 16.1GB. [2022-11-23 14:26:58,948 INFO L158 Benchmark]: Witness Printer took 568.47ms. Allocated memory is still 935.3MB. Free memory was 702.0MB in the beginning and 622.0MB in the end (delta: 80.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-11-23 14:26:58,950 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.22ms. Allocated memory is still 113.2MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.58ms. Allocated memory is still 157.3MB. Free memory was 117.6MB in the beginning and 120.9MB in the end (delta: -3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 157.3MB. Free memory was 120.9MB in the beginning and 119.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.10ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 118.5MB in the end (delta: 980.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.72ms. Allocated memory is still 157.3MB. Free memory was 118.0MB in the beginning and 105.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 201700.36ms. Allocated memory was 157.3MB in the beginning and 935.3MB in the end (delta: 778.0MB). Free memory was 104.9MB in the beginning and 702.0MB in the end (delta: -597.1MB). Peak memory consumption was 554.5MB. Max. memory is 16.1GB. * Witness Printer took 568.47ms. Allocated memory is still 935.3MB. Free memory was 702.0MB in the beginning and 622.0MB in the end (delta: 80.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 [counter=1, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=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 [counter=1, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=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 [counter=1, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=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 [counter=1, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=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 [counter=1, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=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 [counter=2, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [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 [counter=2, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [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 [counter=2, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [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 [counter=2, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [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 [counter=2, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [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 [counter=3, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [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 [counter=3, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [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 [counter=3, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [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 [counter=3, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [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 [counter=3, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [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 [counter=4, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [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 [counter=4, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [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 [counter=4, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [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 [counter=4, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [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 [counter=4, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [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 [counter=5, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [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 [counter=5, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [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 [counter=5, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [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 [counter=5, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [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 [counter=5, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [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 [counter=6, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [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 [counter=6, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [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 [counter=6, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [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 [counter=6, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [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 [counter=6, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [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 [counter=7, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [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 [counter=7, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [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 [counter=7, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [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 [counter=7, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [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 [counter=7, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [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 [counter=8, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [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 [counter=8, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [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 [counter=8, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [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 [counter=8, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [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 [counter=8, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [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 [counter=9, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [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 [counter=9, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [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 [counter=9, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [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 [counter=9, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [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 [counter=9, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [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 [counter=10, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [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 [counter=10, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [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 [counter=10, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [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 [counter=10, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [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 [counter=10, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [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 [counter=11, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [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 [counter=11, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [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 [counter=11, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [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 [counter=11, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [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 [counter=11, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [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 [counter=12, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [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 [counter=12, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [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 [counter=12, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [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 [counter=12, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [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 [counter=12, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [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 [counter=13, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [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 [counter=13, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [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 [counter=13, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [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 [counter=13, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [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 [counter=13, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [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 [counter=14, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [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 [counter=14, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [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 [counter=14, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [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 [counter=14, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [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 [counter=14, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [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 [counter=15, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [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 [counter=15, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [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 [counter=15, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [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 [counter=15, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [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 [counter=15, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [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 [counter=16, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [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 [counter=16, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [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 [counter=16, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [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 [counter=16, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [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 [counter=16, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [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 [counter=17, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [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 [counter=17, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [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 [counter=17, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [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 [counter=17, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [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 [counter=17, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [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 [counter=18, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [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 [counter=18, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [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 [counter=18, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [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 [counter=18, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [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 [counter=18, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [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 [counter=19, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [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 [counter=19, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [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 [counter=19, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [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 [counter=19, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [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 [counter=19, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [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 [counter=20, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [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 [counter=20, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [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 [counter=20, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [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 [counter=20, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [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 [counter=20, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [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 [counter=21, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [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 [counter=21, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [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 [counter=21, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [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 [counter=21, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [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 [counter=21, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [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 [counter=22, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [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 [counter=22, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [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 [counter=22, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [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 [counter=22, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [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 [counter=22, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [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 [counter=23, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [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 [counter=23, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [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 [counter=23, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [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 [counter=23, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [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 [counter=23, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [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 [counter=24, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [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 [counter=24, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [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 [counter=24, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [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 [counter=24, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [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 [counter=24, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [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 [counter=25, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [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 [counter=25, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [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 [counter=25, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [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 [counter=25, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [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 [counter=25, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [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 [counter=26, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [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 [counter=26, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [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 [counter=26, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [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 [counter=26, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [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 [counter=26, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [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 [counter=27, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [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 [counter=27, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [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 [counter=27, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [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 [counter=27, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [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 [counter=27, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [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 [counter=28, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [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 [counter=28, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [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 [counter=28, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [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 [counter=28, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [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 [counter=28, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [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 [counter=29, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [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 [counter=29, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [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 [counter=29, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [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 [counter=29, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [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 [counter=29, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [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 [counter=30, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [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 [counter=30, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [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 [counter=30, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [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 [counter=30, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [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 [counter=30, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [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 [counter=31, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [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 [counter=31, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [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 [counter=31, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [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 [counter=31, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [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 [counter=31, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [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 [counter=32, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [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 [counter=32, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [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 [counter=32, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [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 [counter=32, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [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 [counter=32, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [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 [counter=33, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [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 [counter=33, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [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 [counter=33, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [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 [counter=33, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [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 [counter=33, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [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 [counter=34, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [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 [counter=34, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [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 [counter=34, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [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 [counter=34, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [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 [counter=34, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [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 [counter=35, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [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 [counter=35, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [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 [counter=35, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [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 [counter=35, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [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 [counter=35, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [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 [counter=36, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [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 [counter=36, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [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 [counter=36, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [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 [counter=36, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [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 [counter=36, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [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 [counter=37, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [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 [counter=37, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [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 [counter=37, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [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 [counter=37, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [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 [counter=37, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [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 [counter=38, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [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 [counter=38, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [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 [counter=38, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [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 [counter=38, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [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 [counter=38, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [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 [counter=39, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [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 [counter=39, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [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 [counter=39, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [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 [counter=39, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [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 [counter=39, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [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 [counter=40, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [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 [counter=40, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [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 [counter=40, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [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 [counter=40, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [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 [counter=40, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [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 [counter=41, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [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 [counter=41, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [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 [counter=41, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [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 [counter=41, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [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 [counter=41, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [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 [counter=42, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [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 [counter=42, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [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 [counter=42, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [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 [counter=42, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [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 [counter=42, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [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 [counter=43, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [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 [counter=43, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [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 [counter=43, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [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 [counter=43, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [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 [counter=43, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [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 [counter=44, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [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 [counter=44, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [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 [counter=44, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [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 [counter=44, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [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 [counter=44, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [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 [counter=45, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [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 [counter=45, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [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 [counter=45, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [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 [counter=45, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [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 [counter=45, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [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 [counter=46, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [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 [counter=46, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [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 [counter=46, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [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 [counter=46, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [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 [counter=46, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [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 [counter=47, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [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 [counter=47, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [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 [counter=47, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [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 [counter=47, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [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 [counter=47, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [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 [counter=48, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [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 [counter=48, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [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 [counter=48, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [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 [counter=48, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [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 [counter=48, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [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 [counter=49, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [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 [counter=49, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [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 [counter=49, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [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 [counter=49, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [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 [counter=49, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [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 [counter=50, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [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 [counter=50, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [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 [counter=50, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [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 [counter=50, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [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 [counter=50, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [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 [counter=51, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=51, unknown-#in~cond-unknown=1] [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 [counter=51, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=51, unknown-#in~cond-unknown=1] [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 [counter=51, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=51, unknown-#in~cond-unknown=1] [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 [counter=51, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=51, unknown-#in~cond-unknown=1] [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 [counter=51, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=51, unknown-#in~cond-unknown=1] [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 [counter=52, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=52, unknown-#in~cond-unknown=1] [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 [counter=52, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=52, unknown-#in~cond-unknown=1] [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 [counter=52, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=52, unknown-#in~cond-unknown=1] [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 [counter=52, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=52, unknown-#in~cond-unknown=1] [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 [counter=52, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=52, unknown-#in~cond-unknown=1] [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 [counter=53, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=53, unknown-#in~cond-unknown=1] [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 [counter=53, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=53, unknown-#in~cond-unknown=1] [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 [counter=53, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=53, unknown-#in~cond-unknown=1] [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 [counter=53, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=53, unknown-#in~cond-unknown=1] [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 [counter=53, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=53, unknown-#in~cond-unknown=1] [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 [counter=54, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=54, unknown-#in~cond-unknown=1] [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 [counter=54, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=54, unknown-#in~cond-unknown=1] [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 [counter=54, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=54, unknown-#in~cond-unknown=1] [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 [counter=54, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=54, unknown-#in~cond-unknown=1] [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 [counter=54, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=54, unknown-#in~cond-unknown=1] [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 [counter=55, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=55, unknown-#in~cond-unknown=1] [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 [counter=55, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=55, unknown-#in~cond-unknown=1] [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 [counter=55, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=55, unknown-#in~cond-unknown=1] [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 [counter=55, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=55, unknown-#in~cond-unknown=1] [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 [counter=55, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=55, unknown-#in~cond-unknown=1] [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 [counter=56, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=56, unknown-#in~cond-unknown=1] [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 [counter=56, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=56, unknown-#in~cond-unknown=1] [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 [counter=56, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=56, unknown-#in~cond-unknown=1] [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 [counter=56, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=56, unknown-#in~cond-unknown=1] [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 [counter=56, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=56, unknown-#in~cond-unknown=1] [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 [counter=57, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=57, unknown-#in~cond-unknown=1] [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 [counter=57, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=57, unknown-#in~cond-unknown=1] [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 [counter=57, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=57, unknown-#in~cond-unknown=1] [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 [counter=57, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=57, unknown-#in~cond-unknown=1] [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 [counter=57, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=57, unknown-#in~cond-unknown=1] [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 [counter=58, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=58, unknown-#in~cond-unknown=1] [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 [counter=58, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=58, unknown-#in~cond-unknown=1] [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 [counter=58, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=58, unknown-#in~cond-unknown=1] [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 [counter=58, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=58, unknown-#in~cond-unknown=1] [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 [counter=58, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=58, unknown-#in~cond-unknown=1] [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 [counter=59, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=59, unknown-#in~cond-unknown=1] [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 [counter=59, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=59, unknown-#in~cond-unknown=1] [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 [counter=59, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=59, unknown-#in~cond-unknown=1] [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 [counter=59, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=59, unknown-#in~cond-unknown=1] [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 [counter=59, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=59, unknown-#in~cond-unknown=1] [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 [counter=60, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=60, unknown-#in~cond-unknown=1] [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 [counter=60, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=60, unknown-#in~cond-unknown=1] [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 [counter=60, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=60, unknown-#in~cond-unknown=1] [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 [counter=60, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=60, unknown-#in~cond-unknown=1] [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 [counter=60, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=60, unknown-#in~cond-unknown=1] [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 [counter=61, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=61, unknown-#in~cond-unknown=1] [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 [counter=61, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=61, unknown-#in~cond-unknown=1] [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 [counter=61, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=61, unknown-#in~cond-unknown=1] [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 [counter=61, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=61, unknown-#in~cond-unknown=1] [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 [counter=61, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=61, unknown-#in~cond-unknown=1] [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 [counter=62, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=62, unknown-#in~cond-unknown=1] [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 [counter=62, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=62, unknown-#in~cond-unknown=1] [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 [counter=62, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=62, unknown-#in~cond-unknown=1] [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 [counter=62, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=62, unknown-#in~cond-unknown=1] [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 [counter=62, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=62, unknown-#in~cond-unknown=1] [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 [counter=63, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=63, unknown-#in~cond-unknown=1] [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 [counter=63, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=63, unknown-#in~cond-unknown=1] [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 [counter=63, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=63, unknown-#in~cond-unknown=1] [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 [counter=63, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=63, unknown-#in~cond-unknown=1] [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 [counter=63, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=63, unknown-#in~cond-unknown=1] [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 [counter=64, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=64, unknown-#in~cond-unknown=1] [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 [counter=64, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=64, unknown-#in~cond-unknown=1] [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 [counter=64, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=64, unknown-#in~cond-unknown=1] [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 [counter=64, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=64, unknown-#in~cond-unknown=1] [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 [counter=64, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=64, unknown-#in~cond-unknown=1] [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 [counter=65, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=65, unknown-#in~cond-unknown=1] [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 [counter=65, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=65, unknown-#in~cond-unknown=1] [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 [counter=65, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=65, unknown-#in~cond-unknown=1] [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 [counter=65, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=65, unknown-#in~cond-unknown=1] [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 [counter=65, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=65, unknown-#in~cond-unknown=1] [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 [counter=66, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=66, unknown-#in~cond-unknown=1] [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 [counter=66, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=66, unknown-#in~cond-unknown=1] [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 [counter=66, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=66, unknown-#in~cond-unknown=1] [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 [counter=66, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=66, unknown-#in~cond-unknown=1] [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 [counter=66, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=66, unknown-#in~cond-unknown=1] [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 [counter=67, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=67, unknown-#in~cond-unknown=1] [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 [counter=67, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=67, unknown-#in~cond-unknown=1] [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 [counter=67, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=67, unknown-#in~cond-unknown=1] [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 [counter=67, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=67, unknown-#in~cond-unknown=1] [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 [counter=67, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=67, unknown-#in~cond-unknown=1] [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 [counter=68, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=68, unknown-#in~cond-unknown=1] [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 [counter=68, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=68, unknown-#in~cond-unknown=1] [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 [counter=68, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=68, unknown-#in~cond-unknown=1] [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 [counter=68, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=68, unknown-#in~cond-unknown=1] [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 [counter=68, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=68, unknown-#in~cond-unknown=1] [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 [counter=69, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=69, unknown-#in~cond-unknown=1] [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 [counter=69, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=69, unknown-#in~cond-unknown=1] [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 [counter=69, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=69, unknown-#in~cond-unknown=1] [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 [counter=69, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=69, unknown-#in~cond-unknown=1] [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 [counter=69, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=69, unknown-#in~cond-unknown=1] [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 [counter=70, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=70, unknown-#in~cond-unknown=1] [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 [counter=70, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=70, unknown-#in~cond-unknown=1] [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 [counter=70, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=70, unknown-#in~cond-unknown=1] [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 [counter=70, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=70, unknown-#in~cond-unknown=1] [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 [counter=70, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=70, unknown-#in~cond-unknown=1] [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 [counter=71, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=71, unknown-#in~cond-unknown=1] [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 [counter=71, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=71, unknown-#in~cond-unknown=1] [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 [counter=71, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=71, unknown-#in~cond-unknown=1] [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 [counter=71, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=71, unknown-#in~cond-unknown=1] [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 [counter=71, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=71, unknown-#in~cond-unknown=1] [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 [counter=72, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=72, unknown-#in~cond-unknown=1] [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 [counter=72, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=72, unknown-#in~cond-unknown=1] [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 [counter=72, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=72, unknown-#in~cond-unknown=1] [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 [counter=72, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=72, unknown-#in~cond-unknown=1] [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 [counter=72, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=72, unknown-#in~cond-unknown=1] [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 [counter=73, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=73, unknown-#in~cond-unknown=1] [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 [counter=73, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=73, unknown-#in~cond-unknown=1] [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 [counter=73, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=73, unknown-#in~cond-unknown=1] [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 [counter=73, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=73, unknown-#in~cond-unknown=1] [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 [counter=73, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=73, unknown-#in~cond-unknown=1] [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 [counter=74, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=74, unknown-#in~cond-unknown=1] [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 [counter=74, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=74, unknown-#in~cond-unknown=1] [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 [counter=74, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=74, unknown-#in~cond-unknown=1] [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 [counter=74, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=74, unknown-#in~cond-unknown=1] [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 [counter=74, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=74, unknown-#in~cond-unknown=1] [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 [counter=75, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=75, unknown-#in~cond-unknown=1] [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 [counter=75, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=75, unknown-#in~cond-unknown=1] [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 [counter=75, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=75, unknown-#in~cond-unknown=1] [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 [counter=75, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=75, unknown-#in~cond-unknown=1] [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 [counter=75, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=75, unknown-#in~cond-unknown=1] [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 [counter=76, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=76, unknown-#in~cond-unknown=1] [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 [counter=76, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=76, unknown-#in~cond-unknown=1] [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 [counter=76, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=76, unknown-#in~cond-unknown=1] [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 [counter=76, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=76, unknown-#in~cond-unknown=1] [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 [counter=76, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=76, unknown-#in~cond-unknown=1] [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 [counter=77, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=77, unknown-#in~cond-unknown=1] [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 [counter=77, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=77, unknown-#in~cond-unknown=1] [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 [counter=77, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=77, unknown-#in~cond-unknown=1] [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 [counter=77, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=77, unknown-#in~cond-unknown=1] [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 [counter=77, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=77, unknown-#in~cond-unknown=1] [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 [counter=78, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=78, unknown-#in~cond-unknown=1] [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 [counter=78, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=78, unknown-#in~cond-unknown=1] [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 [counter=78, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=78, unknown-#in~cond-unknown=1] [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 [counter=78, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=78, unknown-#in~cond-unknown=1] [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 [counter=78, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=78, unknown-#in~cond-unknown=1] [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 [counter=79, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=79, unknown-#in~cond-unknown=1] [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 [counter=79, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=79, unknown-#in~cond-unknown=1] [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 [counter=79, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=79, unknown-#in~cond-unknown=1] [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 [counter=79, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=79, unknown-#in~cond-unknown=1] [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 [counter=79, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=79, unknown-#in~cond-unknown=1] [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 [counter=80, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=80, unknown-#in~cond-unknown=1] [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 [counter=80, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=80, unknown-#in~cond-unknown=1] [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 [counter=80, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=80, unknown-#in~cond-unknown=1] [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 [counter=80, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=80, unknown-#in~cond-unknown=1] [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 [counter=80, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=80, unknown-#in~cond-unknown=1] [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 [counter=81, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=81, unknown-#in~cond-unknown=1] [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 [counter=81, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=81, unknown-#in~cond-unknown=1] [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 [counter=81, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=81, unknown-#in~cond-unknown=1] [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 [counter=81, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=81, unknown-#in~cond-unknown=1] [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 [counter=81, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=81, unknown-#in~cond-unknown=1] [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 [counter=82, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=82, unknown-#in~cond-unknown=1] [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 [counter=82, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=82, unknown-#in~cond-unknown=1] [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 [counter=82, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=82, unknown-#in~cond-unknown=1] [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 [counter=82, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=82, unknown-#in~cond-unknown=1] [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 [counter=82, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=82, unknown-#in~cond-unknown=1] [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 [counter=83, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=83, unknown-#in~cond-unknown=1] [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 [counter=83, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=83, unknown-#in~cond-unknown=1] [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 [counter=83, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=83, unknown-#in~cond-unknown=1] [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 [counter=83, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=83, unknown-#in~cond-unknown=1] [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 [counter=83, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=83, unknown-#in~cond-unknown=1] [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 [counter=84, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=84, unknown-#in~cond-unknown=1] [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 [counter=84, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=84, unknown-#in~cond-unknown=1] [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 [counter=84, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=84, unknown-#in~cond-unknown=1] [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 [counter=84, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=84, unknown-#in~cond-unknown=1] [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 [counter=84, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=84, unknown-#in~cond-unknown=1] [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 [counter=85, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=85, unknown-#in~cond-unknown=1] [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 [counter=85, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=85, unknown-#in~cond-unknown=1] [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 [counter=85, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=85, unknown-#in~cond-unknown=1] [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 [counter=85, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=85, unknown-#in~cond-unknown=1] [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 [counter=85, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=85, unknown-#in~cond-unknown=1] [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 [counter=86, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=86, unknown-#in~cond-unknown=1] [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 [counter=86, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=86, unknown-#in~cond-unknown=1] [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 [counter=86, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=86, unknown-#in~cond-unknown=1] [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 [counter=86, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=86, unknown-#in~cond-unknown=1] [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 [counter=86, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=86, unknown-#in~cond-unknown=1] [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 [counter=87, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=87, unknown-#in~cond-unknown=1] [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 [counter=87, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=87, unknown-#in~cond-unknown=1] [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 [counter=87, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=87, unknown-#in~cond-unknown=1] [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 [counter=87, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=87, unknown-#in~cond-unknown=1] [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 [counter=87, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=87, unknown-#in~cond-unknown=1] [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 [counter=88, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=88, unknown-#in~cond-unknown=1] [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 [counter=88, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=88, unknown-#in~cond-unknown=1] [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 [counter=88, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=88, unknown-#in~cond-unknown=1] [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 [counter=88, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=88, unknown-#in~cond-unknown=1] [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 [counter=88, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=88, unknown-#in~cond-unknown=1] [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 [counter=89, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=89, unknown-#in~cond-unknown=1] [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 [counter=89, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=89, unknown-#in~cond-unknown=1] [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 [counter=89, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=89, unknown-#in~cond-unknown=1] [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 [counter=89, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=89, unknown-#in~cond-unknown=1] [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 [counter=89, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=89, unknown-#in~cond-unknown=1] [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 [counter=90, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=90, unknown-#in~cond-unknown=1] [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 [counter=90, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=90, unknown-#in~cond-unknown=1] [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 [counter=90, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=90, unknown-#in~cond-unknown=1] [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 [counter=90, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=90, unknown-#in~cond-unknown=1] [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 [counter=90, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=90, unknown-#in~cond-unknown=1] [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 [counter=91, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=91, unknown-#in~cond-unknown=1] [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 [counter=91, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=91, unknown-#in~cond-unknown=1] [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 [counter=91, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=91, unknown-#in~cond-unknown=1] [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 [counter=91, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=91, unknown-#in~cond-unknown=1] [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 [counter=91, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=91, unknown-#in~cond-unknown=1] [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 [counter=92, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=92, unknown-#in~cond-unknown=1] [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 [counter=92, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=92, unknown-#in~cond-unknown=1] [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 [counter=92, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=92, unknown-#in~cond-unknown=1] [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 [counter=92, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=92, unknown-#in~cond-unknown=1] [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 [counter=92, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=92, unknown-#in~cond-unknown=1] [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 [counter=93, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=93, unknown-#in~cond-unknown=1] [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 [counter=93, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=93, unknown-#in~cond-unknown=1] [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 [counter=93, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=93, unknown-#in~cond-unknown=1] [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 [counter=93, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=93, unknown-#in~cond-unknown=1] [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 [counter=93, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=93, unknown-#in~cond-unknown=1] [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 [counter=94, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=94, unknown-#in~cond-unknown=1] [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 [counter=94, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=94, unknown-#in~cond-unknown=1] [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 [counter=94, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=94, unknown-#in~cond-unknown=1] [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 [counter=94, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=94, unknown-#in~cond-unknown=1] [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 [counter=94, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=94, unknown-#in~cond-unknown=1] [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 [counter=95, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=95, unknown-#in~cond-unknown=1] [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 [counter=95, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=95, unknown-#in~cond-unknown=1] [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 [counter=95, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=95, unknown-#in~cond-unknown=1] [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 [counter=95, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=95, unknown-#in~cond-unknown=1] [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 [counter=95, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=95, unknown-#in~cond-unknown=1] [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 [counter=96, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=96, unknown-#in~cond-unknown=1] [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 [counter=96, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=96, unknown-#in~cond-unknown=1] [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 [counter=96, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=96, unknown-#in~cond-unknown=1] [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 [counter=96, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=96, unknown-#in~cond-unknown=1] [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 [counter=96, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=96, unknown-#in~cond-unknown=1] [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 [counter=97, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=97, unknown-#in~cond-unknown=1] [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 [counter=97, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=97, unknown-#in~cond-unknown=1] [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 [counter=97, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=97, unknown-#in~cond-unknown=1] [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 [counter=97, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=97, unknown-#in~cond-unknown=1] [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 [counter=97, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=97, unknown-#in~cond-unknown=1] [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 [counter=98, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=98, unknown-#in~cond-unknown=1] [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 [counter=98, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=98, unknown-#in~cond-unknown=1] [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 [counter=98, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=98, unknown-#in~cond-unknown=1] [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 [counter=98, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=98, unknown-#in~cond-unknown=1] [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 [counter=98, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=98, unknown-#in~cond-unknown=1] [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 [counter=99, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=99, unknown-#in~cond-unknown=1] [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 [counter=99, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=99, unknown-#in~cond-unknown=1] [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 [counter=99, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=99, unknown-#in~cond-unknown=1] [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 [counter=99, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=99, unknown-#in~cond-unknown=1] [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 [counter=99, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=99, unknown-#in~cond-unknown=1] [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 [counter=100, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=100, unknown-#in~cond-unknown=1] [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 [counter=100, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=100, unknown-#in~cond-unknown=1] [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 [counter=100, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=100, unknown-#in~cond-unknown=1] [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 [counter=100, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=100, unknown-#in~cond-unknown=1] [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 [counter=100, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=100, unknown-#in~cond-unknown=1] [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 [counter=101, unknown-#in~cond-unknown=1] [L15] COND FALSE !(!(cond)) VAL [cond=1, counter=101, unknown-#in~cond-unknown=1] [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 [counter=101, unknown-#in~cond-unknown=0] [L15] COND TRUE !(cond) VAL [cond=0, counter=101, unknown-#in~cond-unknown=0] [L17] reach_error() VAL [cond=0, counter=101, unknown-#in~cond-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 201.1s, OverallIterations: 19, TraceHistogramMax: 502, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 53.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3347 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3293 mSDsluCounter, 6405 SdHoareTripleChecker+Invalid, 24.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4581 mSDsCounter, 4489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10567 IncrementalHoareTripleChecker+Invalid, 15059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4489 mSolverCounterUnsat, 1824 mSDtfsCounter, 10567 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17349 GetRequests, 16338 SyntacticMatches, 98 SemanticMatches, 913 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26952 ImplicationChecksByTransitivity, 86.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2809occurred in iteration=18, InterpolantAutomatonStates: 673, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 8.5s SatisfiabilityAnalysisTime, 37.4s InterpolantComputationTime, 8527 NumberOfCodeBlocks, 8398 NumberOfCodeBlocksAsserted, 195 NumberOfCheckSat, 11307 ConstructedInterpolants, 0 QuantifiedInterpolants, 32209 SizeOfPredicates, 218 NumberOfNonLiveVariables, 12183 ConjunctsInSsa, 697 ConjunctsInUnsatCore, 32 InterpolantComputations, 3 PerfectInterpolantSequences, 601674/1263174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 10, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 10, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 4, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 16, TOOLS_QUANTIFIERELIM_TIME: 0.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 27, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 10, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 55, DAG_COMPRESSION_RETAINED_NODES: 31, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 14:26:59,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c297715-55d1-4644-9fbd-e283df8bcc77/bin/utaipan-Q6hlc19bkW/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