./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI --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 cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed --- 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-5e519f3 [2022-11-03 03:49:36,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:49:36,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:49:37,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:49:37,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:49:37,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:49:37,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:49:37,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:49:37,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:49:37,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:49:37,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:49:37,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:49:37,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:49:37,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:49:37,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:49:37,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:49:37,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:49:37,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:49:37,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:49:37,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:49:37,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:49:37,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:49:37,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:49:37,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:49:37,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:49:37,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:49:37,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:49:37,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:49:37,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:49:37,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:49:37,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:49:37,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:49:37,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:49:37,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:49:37,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:49:37,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:49:37,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:49:37,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:49:37,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:49:37,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:49:37,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:49:37,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:49:37,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:49:37,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:49:37,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:49:37,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:49:37,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:49:37,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:49:37,122 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:49:37,122 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:49:37,122 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:49:37,122 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:49:37,123 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:49:37,124 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:49:37,124 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:49:37,124 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:49:37,125 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:49:37,125 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:49:37,125 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:49:37,125 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:49:37,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:49:37,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:49:37,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:49:37,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:49:37,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:49:37,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:49:37,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:49:37,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:49:37,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:49:37,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:49:37,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:49:37,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:49:37,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:49:37,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:49:37,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:49:37,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:49:37,130 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:49:37,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:49:37,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:49:37,131 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:49:37,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:49:37,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:49:37,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:49:37,134 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_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/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_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI 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 -> cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed [2022-11-03 03:49:37,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:49:37,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:49:37,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:49:37,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:49:37,440 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:49:37,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-11-03 03:49:37,515 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/data/8b4e0bf98/2e58f63359bd4ef8888b2ff18f9b3c04/FLAG280938ece [2022-11-03 03:49:38,055 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:49:38,056 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-11-03 03:49:38,066 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/data/8b4e0bf98/2e58f63359bd4ef8888b2ff18f9b3c04/FLAG280938ece [2022-11-03 03:49:38,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/data/8b4e0bf98/2e58f63359bd4ef8888b2ff18f9b3c04 [2022-11-03 03:49:38,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:49:38,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:49:38,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:49:38,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:49:38,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:49:38,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62baf48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38, skipping insertion in model container [2022-11-03 03:49:38,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:49:38,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:49:38,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-11-03 03:49:38,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:49:38,662 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:49:38,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2022-11-03 03:49:38,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:49:38,700 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:49:38,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38 WrapperNode [2022-11-03 03:49:38,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:49:38,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:49:38,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:49:38,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:49:38,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,751 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-11-03 03:49:38,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:49:38,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:49:38,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:49:38,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:49:38,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,771 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:49:38,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:49:38,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:49:38,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:49:38,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (1/1) ... [2022-11-03 03:49:38,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:49:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:38,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:49:38,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:49:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:49:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:49:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:49:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:49:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 03:49:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 03:49:38,926 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:49:38,928 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:49:39,173 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:49:39,188 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:49:39,188 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:49:39,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:49:39 BoogieIcfgContainer [2022-11-03 03:49:39,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:49:39,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:49:39,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:49:39,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:49:39,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:49:38" (1/3) ... [2022-11-03 03:49:39,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69515f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:49:39, skipping insertion in model container [2022-11-03 03:49:39,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:49:38" (2/3) ... [2022-11-03 03:49:39,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69515f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:49:39, skipping insertion in model container [2022-11-03 03:49:39,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:49:39" (3/3) ... [2022-11-03 03:49:39,220 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-11-03 03:49:39,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:49:39,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:49:39,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:49:39,328 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;@46510f12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:49:39,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:49:39,345 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-03 03:49:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:49:39,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:39,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:49:39,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1408153759, now seen corresponding path program 1 times [2022-11-03 03:49:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:39,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674755677] [2022-11-03 03:49:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:39,558 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-03 03:49:39,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:39,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674755677] [2022-11-03 03:49:39,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674755677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:39,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:39,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:49:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005118731] [2022-11-03 03:49:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:39,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:49:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:39,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:49:39,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:49:39,631 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-03 03:49:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:39,681 INFO L93 Difference]: Finished difference Result 45 states and 82 transitions. [2022-11-03 03:49:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:49:39,684 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-03 03:49:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:39,699 INFO L225 Difference]: With dead ends: 45 [2022-11-03 03:49:39,699 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 03:49:39,712 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-03 03:49:39,722 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-03 03:49:39,723 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-03 03:49:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 03:49:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 03:49:39,759 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-03 03:49:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2022-11-03 03:49:39,762 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 6 [2022-11-03 03:49:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:39,762 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2022-11-03 03:49:39,763 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-03 03:49:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2022-11-03 03:49:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:49:39,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:39,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:39,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:49:39,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1232571916, now seen corresponding path program 1 times [2022-11-03 03:49:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:39,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200692037] [2022-11-03 03:49:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:39,910 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-03 03:49:39,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:39,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200692037] [2022-11-03 03:49:39,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200692037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:39,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:39,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927055960] [2022-11-03 03:49:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:49:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:49:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:49:39,915 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-03 03:49:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:39,939 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2022-11-03 03:49:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:49:39,940 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-03 03:49:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:39,941 INFO L225 Difference]: With dead ends: 35 [2022-11-03 03:49:39,941 INFO L226 Difference]: Without dead ends: 23 [2022-11-03 03:49:39,942 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-03 03:49:39,943 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-03 03:49:39,944 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-03 03:49:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-03 03:49:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-03 03:49:39,950 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-03 03:49:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2022-11-03 03:49:39,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 7 [2022-11-03 03:49:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:39,953 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-11-03 03:49:39,953 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-03 03:49:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-11-03 03:49:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:49:39,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:39,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:39,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:49:39,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1231022784, now seen corresponding path program 1 times [2022-11-03 03:49:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:39,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730953319] [2022-11-03 03:49:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:40,236 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-03 03:49:40,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730953319] [2022-11-03 03:49:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730953319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:40,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:40,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112427732] [2022-11-03 03:49:40,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:40,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:49:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:49:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:49:40,239 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-03 03:49:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:40,349 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-03 03:49:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:49:40,350 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-03 03:49:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:40,351 INFO L225 Difference]: With dead ends: 29 [2022-11-03 03:49:40,351 INFO L226 Difference]: Without dead ends: 27 [2022-11-03 03:49:40,351 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-03 03:49:40,352 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03 03:49:40,353 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-03 03:49:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-03 03:49:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-03 03:49:40,363 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-03 03:49:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-03 03:49:40,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2022-11-03 03:49:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:40,365 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-03 03:49:40,365 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-03 03:49:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-11-03 03:49:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:49:40,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:40,366 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:40,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:49:40,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1004679035, now seen corresponding path program 1 times [2022-11-03 03:49:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160569046] [2022-11-03 03:49:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:40,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:49:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233879946] [2022-11-03 03:49:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:40,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:40,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:49:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:40,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:49:40,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:40,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:49:40,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160569046] [2022-11-03 03:49:40,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:49:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233879946] [2022-11-03 03:49:40,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233879946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:40,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:49:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914703100] [2022-11-03 03:49:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:49:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:49:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:49:40,574 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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-03 03:49:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:40,686 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-11-03 03:49:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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-03 03:49:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:40,688 INFO L225 Difference]: With dead ends: 45 [2022-11-03 03:49:40,689 INFO L226 Difference]: Without dead ends: 43 [2022-11-03 03:49:40,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-03 03:49:40,690 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:40,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:49:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-03 03:49:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-11-03 03:49:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-03 03:49:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-11-03 03:49:40,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 12 [2022-11-03 03:49:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:40,708 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-11-03 03:49:40,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 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-03 03:49:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-11-03 03:49:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:49:40,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:40,709 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:40,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:49:40,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:40,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 752381984, now seen corresponding path program 1 times [2022-11-03 03:49:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:40,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408596166] [2022-11-03 03:49:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:40,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:49:40,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399308130] [2022-11-03 03:49:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:40,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:40,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:40,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:49:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:41,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:49:41,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 03:49:41,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:49:41,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408596166] [2022-11-03 03:49:41,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:49:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399308130] [2022-11-03 03:49:41,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399308130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:41,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:41,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:49:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087721102] [2022-11-03 03:49:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:41,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:49:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:49:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:49:41,131 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:49:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:41,225 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-11-03 03:49:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:41,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-03 03:49:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:41,227 INFO L225 Difference]: With dead ends: 49 [2022-11-03 03:49:41,227 INFO L226 Difference]: Without dead ends: 47 [2022-11-03 03:49:41,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-03 03:49:41,228 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:41,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:49:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-03 03:49:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-11-03 03:49:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-03 03:49:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-11-03 03:49:41,245 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 17 [2022-11-03 03:49:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:41,246 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-03 03:49:41,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:49:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2022-11-03 03:49:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:49:41,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:41,247 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:41,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:49:41,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:41,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2088406747, now seen corresponding path program 1 times [2022-11-03 03:49:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:41,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443690472] [2022-11-03 03:49:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:41,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:49:41,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961479713] [2022-11-03 03:49:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:41,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:41,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:41,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:49:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:41,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:49:41,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 03:49:41,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:49:41,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:41,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443690472] [2022-11-03 03:49:41,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:49:41,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961479713] [2022-11-03 03:49:41,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961479713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:41,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:41,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:49:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684144133] [2022-11-03 03:49:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:41,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:49:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:49:41,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:49:41,692 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:49:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:41,854 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-11-03 03:49:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:41,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-11-03 03:49:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:41,858 INFO L225 Difference]: With dead ends: 57 [2022-11-03 03:49:41,858 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 03:49:41,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-03 03:49:41,859 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:41,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:49:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 03:49:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 03:49:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-03 03:49:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-11-03 03:49:41,886 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 22 [2022-11-03 03:49:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:41,886 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-11-03 03:49:41,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:49:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-11-03 03:49:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:49:41,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:41,888 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-03 03:49:41,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:49:42,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:49:42,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash 204620983, now seen corresponding path program 1 times [2022-11-03 03:49:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:42,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620477180] [2022-11-03 03:49:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:42,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:49:42,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112588027] [2022-11-03 03:49:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:42,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:42,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:42,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:49:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:42,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:49:42,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:42,267 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-03 03:49:42,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:42,331 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-03 03:49:42,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:42,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620477180] [2022-11-03 03:49:42,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:49:42,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112588027] [2022-11-03 03:49:42,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112588027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:42,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [456678088] [2022-11-03 03:49:42,352 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:49:42,352 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:49:42,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:49:42,362 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:49:42,371 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:49:46,681 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:49:46,686 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:49:51,414 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1154#(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-03 03:49:51,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:49:51,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:49:51,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-03 03:49:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894408242] [2022-11-03 03:49:51,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:51,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:49:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:49:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:49:51,416 INFO L87 Difference]: Start difference. First operand 45 states and 57 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-03 03:49:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:51,666 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-11-03 03:49:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:49:51,667 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-03 03:49:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:51,669 INFO L225 Difference]: With dead ends: 115 [2022-11-03 03:49:51,669 INFO L226 Difference]: Without dead ends: 99 [2022-11-03 03:49:51,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:49:51,670 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 63 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:51,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 168 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:49:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-03 03:49:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-11-03 03:49:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 03:49:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2022-11-03 03:49:51,692 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 40 [2022-11-03 03:49:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:51,692 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2022-11-03 03:49:51,693 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-03 03:49:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2022-11-03 03:49:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:49:51,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:51,694 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-03 03:49:51,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:49:51,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:51,923 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 696736299, now seen corresponding path program 1 times [2022-11-03 03:49:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127084954] [2022-11-03 03:49:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:51,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:49:51,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831428680] [2022-11-03 03:49:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:51,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:51,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:51,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:51,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:49:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:49:52,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-03 03:49:52,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-03 03:49:52,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:52,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127084954] [2022-11-03 03:49:52,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:49:52,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831428680] [2022-11-03 03:49:52,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831428680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:52,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1963835829] [2022-11-03 03:49:52,224 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 03:49:52,230 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:49:52,230 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:49:52,231 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:49:52,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:49:55,694 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:49:55,699 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:49:56,485 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1740#(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-03 03:49:56,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:49:56,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:49:56,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-03 03:49:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824511277] [2022-11-03 03:49:56,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:56,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:49:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:56,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:49:56,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:49:56,488 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-03 03:49:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:56,833 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2022-11-03 03:49:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:49:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 40 [2022-11-03 03:49:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:56,835 INFO L225 Difference]: With dead ends: 113 [2022-11-03 03:49:56,835 INFO L226 Difference]: Without dead ends: 111 [2022-11-03 03:49:56,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-03 03:49:56,837 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:56,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:49:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-03 03:49:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-03 03:49:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 03:49:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2022-11-03 03:49:56,887 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 40 [2022-11-03 03:49:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:56,889 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2022-11-03 03:49:56,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-03 03:49:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2022-11-03 03:49:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:49:56,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:56,893 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-03 03:49:56,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:49:57,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:57,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:49:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1539244486, now seen corresponding path program 2 times [2022-11-03 03:49:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:57,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004644422] [2022-11-03 03:49:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:57,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:49:57,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961447864] [2022-11-03 03:49:57,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:49:57,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:57,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:57,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:49:57,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:49:57,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:49:57,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:49:57,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:57,264 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-03 03:49:57,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:57,358 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-03 03:49:57,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004644422] [2022-11-03 03:49:57,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:49:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961447864] [2022-11-03 03:49:57,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961447864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:57,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [512150540] [2022-11-03 03:49:57,362 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 03:49:57,362 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:49:57,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:49:57,362 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:49:57,363 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:00,279 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:50:00,284 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:06,407 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2368#(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-03 03:50:06,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:06,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:50:06,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-03 03:50:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152362020] [2022-11-03 03:50:06,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:06,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:50:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:50:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:50:06,409 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (16), 2 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-03 03:50:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:06,600 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-11-03 03:50:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:50:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (16), 2 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-03 03:50:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:06,603 INFO L225 Difference]: With dead ends: 117 [2022-11-03 03:50:06,603 INFO L226 Difference]: Without dead ends: 115 [2022-11-03 03:50:06,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:50:06,604 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:06,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 157 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:50:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-03 03:50:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-03 03:50:06,628 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-03 03:50:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-11-03 03:50:06,630 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 45 [2022-11-03 03:50:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:06,630 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-11-03 03:50:06,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (16), 2 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-03 03:50:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-11-03 03:50:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 03:50:06,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:06,632 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-03 03:50:06,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:06,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:06,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash -375151797, now seen corresponding path program 3 times [2022-11-03 03:50:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:06,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648929557] [2022-11-03 03:50:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:06,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:50:06,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231679919] [2022-11-03 03:50:06,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:50:06,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:06,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:06,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:06,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:50:06,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:50:06,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:06,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:50:06,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-03 03:50:07,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-03 03:50:07,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:07,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648929557] [2022-11-03 03:50:07,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:50:07,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231679919] [2022-11-03 03:50:07,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231679919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:07,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987105592] [2022-11-03 03:50:07,213 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 03:50:07,214 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:07,214 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:07,214 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:07,215 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:10,668 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2022-11-03 03:50:10,679 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:11,640 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3032#(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-03 03:50:11,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:11,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:50:11,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-03 03:50:11,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107964937] [2022-11-03 03:50:11,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:11,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:50:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:50:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:50:11,643 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-11-03 03:50:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:12,014 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2022-11-03 03:50:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:50:12,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 50 [2022-11-03 03:50:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:12,016 INFO L225 Difference]: With dead ends: 141 [2022-11-03 03:50:12,016 INFO L226 Difference]: Without dead ends: 130 [2022-11-03 03:50:12,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:50:12,017 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:12,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 111 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:50:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-03 03:50:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-03 03:50:12,050 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-03 03:50:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-11-03 03:50:12,052 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 50 [2022-11-03 03:50:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:12,052 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-11-03 03:50:12,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-11-03 03:50:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-11-03 03:50:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 03:50:12,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:12,054 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-03 03:50:12,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:12,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:12,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 780075682, now seen corresponding path program 1 times [2022-11-03 03:50:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:12,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022448461] [2022-11-03 03:50:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:12,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:50:12,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932167876] [2022-11-03 03:50:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:12,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:12,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:12,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:12,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:50:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:12,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:50:12,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-11-03 03:50:12,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:12,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:12,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022448461] [2022-11-03 03:50:12,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:50:12,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932167876] [2022-11-03 03:50:12,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932167876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212191745] [2022-11-03 03:50:12,804 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:50:12,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:12,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:12,805 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:12,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:16,311 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:50:16,315 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:17,855 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3760#(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-03 03:50:17,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:17,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:50:17,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-03 03:50:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586350174] [2022-11-03 03:50:17,856 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:17,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:50:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:50:17,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-03 03:50:17,857 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 03:50:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:18,056 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-11-03 03:50:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:50:18,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 66 [2022-11-03 03:50:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:18,058 INFO L225 Difference]: With dead ends: 136 [2022-11-03 03:50:18,058 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 03:50:18,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:50:18,060 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:18,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:50:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 03:50:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 03:50:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 83 states have internal predecessors, (87), 29 states have call successors, (29), 22 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-03 03:50:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-11-03 03:50:18,086 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 66 [2022-11-03 03:50:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:18,087 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-11-03 03:50:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 03:50:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-11-03 03:50:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-03 03:50:18,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:18,089 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-03 03:50:18,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:18,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:50:18,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1686864157, now seen corresponding path program 1 times [2022-11-03 03:50:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:18,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945956960] [2022-11-03 03:50:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:18,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:50:18,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559478103] [2022-11-03 03:50:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:18,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:18,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:18,326 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:18,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:50:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:18,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 03:50:18,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-03 03:50:18,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:18,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945956960] [2022-11-03 03:50:18,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:50:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559478103] [2022-11-03 03:50:18,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559478103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [258454040] [2022-11-03 03:50:18,903 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:50:18,903 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:18,904 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:18,904 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:18,904 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:22,607 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:50:22,610 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:24,042 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4509#(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-03 03:50:24,042 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:24,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:50:24,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-03 03:50:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925554468] [2022-11-03 03:50:24,043 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:24,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:50:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:50:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:50:24,044 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-03 03:50:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:24,223 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-11-03 03:50:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:50:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 71 [2022-11-03 03:50:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:24,225 INFO L225 Difference]: With dead ends: 134 [2022-11-03 03:50:24,225 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 03:50:24,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-11-03 03:50:24,226 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:24,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:50:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 03:50:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-03 03:50:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 78 states have internal predecessors, (81), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-03 03:50:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2022-11-03 03:50:24,250 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 71 [2022-11-03 03:50:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:24,251 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2022-11-03 03:50:24,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-03 03:50:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2022-11-03 03:50:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 03:50:24,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:24,252 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-03 03:50:24,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:24,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 03:50:24,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -226115244, now seen corresponding path program 4 times [2022-11-03 03:50:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:24,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143984978] [2022-11-03 03:50:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:24,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:50:24,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935991479] [2022-11-03 03:50:24,480 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:50:24,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:24,482 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:24,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:50:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:24,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 03:50:24,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 56 proven. 19 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-11-03 03:50:24,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 56 proven. 19 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-11-03 03:50:25,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:25,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143984978] [2022-11-03 03:50:25,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:50:25,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935991479] [2022-11-03 03:50:25,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935991479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:25,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [792267812] [2022-11-03 03:50:25,103 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 03:50:25,103 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:25,104 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:25,104 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:25,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:27,770 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:50:27,774 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:31,986 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5338#(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-03 03:50:31,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:31,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:50:31,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-11-03 03:50:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462246586] [2022-11-03 03:50:31,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:31,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 03:50:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 03:50:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=576, Unknown=1, NotChecked=0, Total=702 [2022-11-03 03:50:31,988 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 15 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-03 03:50:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:33,081 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-11-03 03:50:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:50:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24) Word has length 73 [2022-11-03 03:50:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:33,084 INFO L225 Difference]: With dead ends: 138 [2022-11-03 03:50:33,084 INFO L226 Difference]: Without dead ends: 136 [2022-11-03 03:50:33,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=178, Invalid=813, Unknown=1, NotChecked=0, Total=992 [2022-11-03 03:50:33,086 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:33,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 79 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:50:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-03 03:50:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-11-03 03:50:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 81 states have internal predecessors, (83), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-03 03:50:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-11-03 03:50:33,114 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 73 [2022-11-03 03:50:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:33,115 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-11-03 03:50:33,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-03 03:50:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-11-03 03:50:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-03 03:50:33,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:33,117 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:33,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-03 03:50:33,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:33,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1183378488, now seen corresponding path program 2 times [2022-11-03 03:50:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:33,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711019591] [2022-11-03 03:50:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:33,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:50:33,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592312146] [2022-11-03 03:50:33,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:50:33,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:33,342 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:33,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:50:33,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:50:33,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:33,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 03:50:33,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-11-03 03:50:34,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-11-03 03:50:34,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711019591] [2022-11-03 03:50:34,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:50:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592312146] [2022-11-03 03:50:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592312146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1862652220] [2022-11-03 03:50:34,670 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:50:34,670 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:34,671 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:34,671 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:34,671 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:37,523 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:50:37,527 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:43,432 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6301#(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-03 03:50:43,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:43,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:50:43,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-11-03 03:50:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197713495] [2022-11-03 03:50:43,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:43,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:50:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:50:43,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:50:43,435 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-11-03 03:50:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:55,331 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2022-11-03 03:50:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:50:55,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 94 [2022-11-03 03:50:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:55,334 INFO L225 Difference]: With dead ends: 167 [2022-11-03 03:50:55,334 INFO L226 Difference]: Without dead ends: 165 [2022-11-03 03:50:55,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=169, Invalid=820, Unknown=3, NotChecked=0, Total=992 [2022-11-03 03:50:55,335 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:55,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 207 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:50:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-03 03:50:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2022-11-03 03:50:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.101123595505618) internal successors, (98), 92 states have internal predecessors, (98), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-03 03:50:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2022-11-03 03:50:55,387 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 94 [2022-11-03 03:50:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:55,387 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2022-11-03 03:50:55,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-11-03 03:50:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2022-11-03 03:50:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 03:50:55,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:55,389 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-03 03:50:55,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:55,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:55,599 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1857500541, now seen corresponding path program 2 times [2022-11-03 03:50:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:55,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603072598] [2022-11-03 03:50:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:55,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:50:55,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457486757] [2022-11-03 03:50:55,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:50:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:55,608 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:55,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:50:55,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:50:55,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:55,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:50:55,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 81 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-11-03 03:50:55,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:56,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603072598] [2022-11-03 03:50:56,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:50:56,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457486757] [2022-11-03 03:50:56,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457486757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:56,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515804295] [2022-11-03 03:50:56,354 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:50:56,355 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:56,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:56,355 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:56,355 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:59,134 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2022-11-03 03:50:59,170 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:51:06,298 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7240#(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-03 03:51:06,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:51:06,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:51:06,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-11-03 03:51:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431354678] [2022-11-03 03:51:06,299 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:06,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:51:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:06,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:51:06,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:51:06,301 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-03 03:51:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:06,981 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2022-11-03 03:51:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:51:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 99 [2022-11-03 03:51:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:06,983 INFO L225 Difference]: With dead ends: 161 [2022-11-03 03:51:06,984 INFO L226 Difference]: Without dead ends: 152 [2022-11-03 03:51:06,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:51:06,985 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:06,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:51:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-03 03:51:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-03 03:51:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 89 states have (on average 1.0898876404494382) internal successors, (97), 91 states have internal predecessors, (97), 40 states have call successors, (40), 22 states have call predecessors, (40), 22 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-03 03:51:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2022-11-03 03:51:07,039 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 99 [2022-11-03 03:51:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:07,039 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2022-11-03 03:51:07,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-03 03:51:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2022-11-03 03:51:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-03 03:51:07,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:07,041 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-03 03:51:07,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:07,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:51:07,257 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:51:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2067588009, now seen corresponding path program 2 times [2022-11-03 03:51:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:07,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622749909] [2022-11-03 03:51:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:07,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:51:07,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832302518] [2022-11-03 03:51:07,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:51:07,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:07,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:07,271 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:07,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 03:51:07,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-03 03:51:07,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:07,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 03:51:07,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:07,547 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-03 03:51:07,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:07,697 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-03 03:51:07,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:07,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622749909] [2022-11-03 03:51:07,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:51:07,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832302518] [2022-11-03 03:51:07,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832302518] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:07,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153360209] [2022-11-03 03:51:07,700 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:51:07,700 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:07,701 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:51:07,701 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:51:07,701 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:51:11,122 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:51:11,126 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:51:11,943 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8467#(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-03 03:51:11,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:51:11,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:51:11,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-03 03:51:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635136682] [2022-11-03 03:51:11,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:51:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:51:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:51:11,946 INFO L87 Difference]: Start difference. First operand 152 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-03 03:51:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:12,473 INFO L93 Difference]: Finished difference Result 371 states and 389 transitions. [2022-11-03 03:51:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:51:12,474 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-03 03:51:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:12,476 INFO L225 Difference]: With dead ends: 371 [2022-11-03 03:51:12,476 INFO L226 Difference]: Without dead ends: 352 [2022-11-03 03:51:12,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 03:51:12,477 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 119 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:12,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:51:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-03 03:51:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 306. [2022-11-03 03:51:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 192 states have (on average 1.046875) internal successors, (201), 198 states have internal predecessors, (201), 61 states have call successors, (61), 53 states have call predecessors, (61), 52 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-03 03:51:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 321 transitions. [2022-11-03 03:51:12,552 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 321 transitions. Word has length 124 [2022-11-03 03:51:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:12,553 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 321 transitions. [2022-11-03 03:51:12,553 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-03 03:51:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 321 transitions. [2022-11-03 03:51:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-03 03:51:12,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:12,554 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:12,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:12,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:51:12,771 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:51:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1367105815, now seen corresponding path program 3 times [2022-11-03 03:51:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:12,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100296158] [2022-11-03 03:51:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:12,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:51:12,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390887926] [2022-11-03 03:51:12,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:51:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:12,782 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:12,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 03:51:14,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:51:14,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:14,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 03:51:14,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 215 proven. 128 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2022-11-03 03:51:15,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 171 proven. 17 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2022-11-03 03:51:17,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100296158] [2022-11-03 03:51:17,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:51:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390887926] [2022-11-03 03:51:17,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390887926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128560970] [2022-11-03 03:51:17,799 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:51:17,799 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:17,800 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:51:17,800 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:51:17,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:51:21,476 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:51:21,480 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:51:23,369 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10221#(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-03 03:51:23,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:51:23,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:51:23,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2022-11-03 03:51:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215621503] [2022-11-03 03:51:23,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:23,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:51:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:51:23,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:51:23,371 INFO L87 Difference]: Start difference. First operand 306 states and 321 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 11 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-03 03:51:27,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 03:51:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:28,544 INFO L93 Difference]: Finished difference Result 315 states and 331 transitions. [2022-11-03 03:51:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:51:28,545 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 11 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 11 states have call successors, (30) Word has length 127 [2022-11-03 03:51:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:28,547 INFO L225 Difference]: With dead ends: 315 [2022-11-03 03:51:28,547 INFO L226 Difference]: Without dead ends: 292 [2022-11-03 03:51:28,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 346 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 03:51:28,548 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:28,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 71 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 03:51:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-03 03:51:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-03 03:51:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 187 states have (on average 1.0106951871657754) internal successors, (189), 188 states have internal predecessors, (189), 53 states have call successors, (53), 51 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-03 03:51:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 294 transitions. [2022-11-03 03:51:28,608 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 294 transitions. Word has length 127 [2022-11-03 03:51:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:28,609 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 294 transitions. [2022-11-03 03:51:28,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 11 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-03 03:51:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 294 transitions. [2022-11-03 03:51:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-03 03:51:28,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:28,613 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-03 03:51:28,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:28,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:28,825 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:51:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1818744179, now seen corresponding path program 3 times [2022-11-03 03:51:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:28,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398629919] [2022-11-03 03:51:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:28,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:51:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251429544] [2022-11-03 03:51:28,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:51:28,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:28,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:28,839 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:28,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 03:51:29,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:51:29,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:29,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 03:51:29,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:29,522 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-03 03:51:29,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:30,000 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-03 03:51:30,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:30,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398629919] [2022-11-03 03:51:30,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:51:30,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251429544] [2022-11-03 03:51:30,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251429544] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:30,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620882764] [2022-11-03 03:51:30,003 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:51:30,004 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:30,004 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:51:30,004 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:51:30,004 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:51:32,628 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:51:32,632 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:51:34,890 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12864#(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-03 03:51:34,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:51:34,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:51:34,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-03 03:51:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484959820] [2022-11-03 03:51:34,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:34,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:51:34,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:34,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:51:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 03:51:34,900 INFO L87 Difference]: Start difference. First operand 292 states and 294 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 26 states have internal predecessors, (104), 21 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 21 states have call predecessors, (102), 21 states have call successors, (102) [2022-11-03 03:51:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:36,253 INFO L93 Difference]: Finished difference Result 641 states and 655 transitions. [2022-11-03 03:51:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 03:51:36,254 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-03 03:51:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:36,257 INFO L225 Difference]: With dead ends: 641 [2022-11-03 03:51:36,257 INFO L226 Difference]: Without dead ends: 628 [2022-11-03 03:51:36,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=864, Invalid=2796, Unknown=0, NotChecked=0, Total=3660 [2022-11-03 03:51:36,259 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 236 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:36,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 385 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:51:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-03 03:51:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2022-11-03 03:51:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 403 states have (on average 1.0049627791563276) internal successors, (405), 404 states have internal predecessors, (405), 113 states have call successors, (113), 111 states have call predecessors, (113), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-11-03 03:51:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 630 transitions. [2022-11-03 03:51:36,441 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 630 transitions. Word has length 292 [2022-11-03 03:51:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:36,442 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 630 transitions. [2022-11-03 03:51:36,442 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-03 03:51:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 630 transitions. [2022-11-03 03:51:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2022-11-03 03:51:36,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:36,457 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-03 03:51:36,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:51:36,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:51:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1500193707, now seen corresponding path program 4 times [2022-11-03 03:51:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:36,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630525454] [2022-11-03 03:51:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:36,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:51:36,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988001510] [2022-11-03 03:51:36,698 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:51:36,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:36,699 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:36,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 03:51:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:36,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:51:36,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:38,066 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-03 03:51:38,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:39,426 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-03 03:51:39,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:39,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630525454] [2022-11-03 03:51:39,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:51:39,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988001510] [2022-11-03 03:51:39,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988001510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:39,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [435047990] [2022-11-03 03:51:39,429 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:51:39,429 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:39,430 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:51:39,430 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:51:39,430 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:51:42,556 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 03:51:42,560 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:51:43,595 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18500#(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-03 03:51:43,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:51:43,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:51:43,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-03 03:51:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204514722] [2022-11-03 03:51:43,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:43,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 03:51:43,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 03:51:43,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=2831, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 03:51:43,601 INFO L87 Difference]: Start difference. First operand 628 states and 630 transitions. Second operand has 50 states, 50 states have (on average 4.24) internal successors, (212), 50 states have internal predecessors, (212), 45 states have call successors, (223), 24 states have call predecessors, (223), 24 states have return successors, (222), 45 states have call predecessors, (222), 45 states have call successors, (222) [2022-11-03 03:51:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:47,123 INFO L93 Difference]: Finished difference Result 1313 states and 1339 transitions. [2022-11-03 03:51:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-03 03:51:47,124 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-03 03:51:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:47,129 INFO L225 Difference]: With dead ends: 1313 [2022-11-03 03:51:47,130 INFO L226 Difference]: Without dead ends: 1300 [2022-11-03 03:51:47,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1927 GetRequests, 1820 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3384, Invalid=8388, Unknown=0, NotChecked=0, Total=11772 [2022-11-03 03:51:47,134 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 680 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 940 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 940 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:47,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 967 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [940 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 03:51:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-11-03 03:51:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2022-11-03 03:51:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 835 states have (on average 1.0023952095808384) internal successors, (837), 836 states have internal predecessors, (837), 233 states have call successors, (233), 231 states have call predecessors, (233), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-11-03 03:51:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1302 transitions. [2022-11-03 03:51:47,519 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1302 transitions. Word has length 628 [2022-11-03 03:51:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:47,521 INFO L495 AbstractCegarLoop]: Abstraction has 1300 states and 1302 transitions. [2022-11-03 03:51:47,522 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-03 03:51:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1302 transitions. [2022-11-03 03:51:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2022-11-03 03:51:47,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:47,541 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-03 03:51:47,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:47,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:47,760 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:51:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 622252005, now seen corresponding path program 5 times [2022-11-03 03:51:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842270670] [2022-11-03 03:51:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:47,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:51:47,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059317746] [2022-11-03 03:51:47,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:51:47,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:47,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:47,823 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:47,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 03:51:50,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 162 check-sat command(s) [2022-11-03 03:51:50,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:50,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-03 03:51:50,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:53,612 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-03 03:51:53,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:55,853 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-03 03:51:55,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:55,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842270670] [2022-11-03 03:51:55,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:51:55,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059317746] [2022-11-03 03:51:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059317746] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [265601049] [2022-11-03 03:51:55,856 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:51:55,856 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:55,856 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:51:55,856 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:51:55,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:51:59,088 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2022-11-03 03:51:59,104 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:52:00,562 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30092#(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-03 03:52:00,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:52:00,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:52:00,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-03 03:52:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244766420] [2022-11-03 03:52:00,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:00,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-03 03:52:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-03 03:52:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1399, Invalid=3157, Unknown=0, NotChecked=0, Total=4556 [2022-11-03 03:52:00,568 INFO L87 Difference]: Start difference. First operand 1300 states and 1302 transitions. Second operand has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) [2022-11-03 03:52:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:04,049 INFO L93 Difference]: Finished difference Result 1425 states and 1431 transitions. [2022-11-03 03:52:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-03 03:52:04,050 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) Word has length 1300 [2022-11-03 03:52:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:04,057 INFO L225 Difference]: With dead ends: 1425 [2022-11-03 03:52:04,057 INFO L226 Difference]: Without dead ends: 1412 [2022-11-03 03:52:04,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3947 GetRequests, 3788 SyntacticMatches, 44 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3665 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3994, Invalid=9578, Unknown=0, NotChecked=0, Total=13572 [2022-11-03 03:52:04,062 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 165 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:04,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 777 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 03:52:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2022-11-03 03:52:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2022-11-03 03:52:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 907 states have (on average 1.0022050716648292) internal successors, (909), 908 states have internal predecessors, (909), 253 states have call successors, (253), 251 states have call predecessors, (253), 251 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-11-03 03:52:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1414 transitions. [2022-11-03 03:52:04,420 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1414 transitions. Word has length 1300 [2022-11-03 03:52:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:04,423 INFO L495 AbstractCegarLoop]: Abstraction has 1412 states and 1414 transitions. [2022-11-03 03:52:04,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 50 states have call successors, (463), 48 states have call predecessors, (463), 48 states have return successors, (462), 50 states have call predecessors, (462), 50 states have call successors, (462) [2022-11-03 03:52:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1414 transitions. [2022-11-03 03:52:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1413 [2022-11-03 03:52:04,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:04,444 INFO L195 NwaCegarLoop]: trace histogram [252, 251, 251, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:04,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-03 03:52:04,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:04,656 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:52:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1959403395, now seen corresponding path program 6 times [2022-11-03 03:52:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:04,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5280012] [2022-11-03 03:52:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:04,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:52:04,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174862022] [2022-11-03 03:52:04,719 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:52:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:04,720 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:04,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 03:52:05,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:52:05,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-03 03:52:05,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:52:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:52:06,697 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:52:06,698 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:52:06,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:52:06,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:06,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 03:52:06,925 INFO L444 BasicCegarLoop]: Path program histogram: [6, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:06,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:52:07,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:52:07 BoogieIcfgContainer [2022-11-03 03:52:07,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:52:07,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:52:07,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:52:07,195 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:52:07,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:49:39" (3/4) ... [2022-11-03 03:52:07,197 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:52:07,477 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:52:07,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:52:07,478 INFO L158 Benchmark]: Toolchain (without parser) took 149071.29ms. Allocated memory was 90.2MB in the beginning and 559.9MB in the end (delta: 469.8MB). Free memory was 51.4MB in the beginning and 323.5MB in the end (delta: -272.1MB). Peak memory consumption was 197.4MB. Max. memory is 16.1GB. [2022-11-03 03:52:07,479 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 90.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:52:07,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.07ms. Allocated memory is still 90.2MB. Free memory was 51.3MB in the beginning and 63.8MB in the end (delta: -12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:52:07,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.23ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 62.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:52:07,480 INFO L158 Benchmark]: Boogie Preprocessor took 22.10ms. Allocated memory is still 90.2MB. Free memory was 62.1MB in the beginning and 61.1MB in the end (delta: 989.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:52:07,484 INFO L158 Benchmark]: RCFGBuilder took 416.21ms. Allocated memory is still 90.2MB. Free memory was 60.8MB in the beginning and 49.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 03:52:07,485 INFO L158 Benchmark]: TraceAbstraction took 148000.86ms. Allocated memory was 90.2MB in the beginning and 559.9MB in the end (delta: 469.8MB). Free memory was 48.5MB in the beginning and 362.2MB in the end (delta: -313.7MB). Peak memory consumption was 158.0MB. Max. memory is 16.1GB. [2022-11-03 03:52:07,487 INFO L158 Benchmark]: Witness Printer took 282.92ms. Allocated memory is still 559.9MB. Free memory was 362.2MB in the beginning and 323.5MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-03 03:52:07,490 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.31ms. Allocated memory is still 90.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.07ms. Allocated memory is still 90.2MB. Free memory was 51.3MB in the beginning and 63.8MB in the end (delta: -12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.23ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 62.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.10ms. Allocated memory is still 90.2MB. Free memory was 62.1MB in the beginning and 61.1MB in the end (delta: 989.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.21ms. Allocated memory is still 90.2MB. Free memory was 60.8MB in the beginning and 49.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 148000.86ms. Allocated memory was 90.2MB in the beginning and 559.9MB in the end (delta: 469.8MB). Free memory was 48.5MB in the beginning and 362.2MB in the end (delta: -313.7MB). Peak memory consumption was 158.0MB. Max. memory is 16.1GB. * Witness Printer took 282.92ms. Allocated memory is still 559.9MB. Free memory was 362.2MB in the beginning and 323.5MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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=50, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=50, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=50, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=50, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=50, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=50, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=50, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=50, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=50, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=50, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=50, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=50, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=50, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=50, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=50, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=50, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=50, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=50, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=50, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=50, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=50, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=50, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [a=50, counter=22, counter++=21, n=21, x=9261, y=1387, z=132] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [a=50, counter=23, counter++=22, n=22, x=10648, y=1519, z=138] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [a=50, counter=24, counter++=23, n=23, x=12167, y=1657, z=144] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [a=50, counter=25, counter++=24, n=24, x=13824, y=1801, z=150] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [a=50, counter=26, counter++=25, n=25, x=15625, y=1951, z=156] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [a=50, counter=27, counter++=26, n=26, x=17576, y=2107, z=162] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [a=50, counter=28, counter++=27, n=27, x=19683, y=2269, z=168] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [a=50, counter=29, counter++=28, n=28, x=21952, y=2437, z=174] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [a=50, counter=30, counter++=29, n=29, x=24389, y=2611, z=180] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [a=50, counter=31, counter++=30, n=30, x=27000, y=2791, z=186] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [a=50, counter=32, counter++=31, n=31, x=29791, y=2977, z=192] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [a=50, counter=33, counter++=32, n=32, x=32768, y=3169, z=198] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [a=50, counter=34, counter++=33, n=33, x=35937, y=3367, z=204] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [a=50, counter=35, counter++=34, n=34, x=39304, y=3571, z=210] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [a=50, counter=36, counter++=35, n=35, x=42875, y=3781, z=216] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [a=50, counter=37, counter++=36, n=36, x=46656, y=3997, z=222] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [a=50, counter=38, counter++=37, n=37, x=50653, y=4219, z=228] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [a=50, counter=39, counter++=38, n=38, x=54872, y=4447, z=234] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [a=50, counter=40, counter++=39, n=39, x=59319, y=4681, z=240] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [a=50, counter=41, counter++=40, n=40, x=64000, y=4921, z=246] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [a=50, counter=42, counter++=41, n=41, x=68921, y=5167, z=252] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [a=50, counter=43, counter++=42, n=42, x=74088, y=5419, z=258] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [a=50, counter=44, counter++=43, n=43, x=79507, y=5677, z=264] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [a=50, counter=45, counter++=44, n=44, x=85184, y=5941, z=270] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [a=50, counter=46, counter++=45, n=45, x=91125, y=6211, z=276] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [a=50, counter=47, counter++=46, n=46, x=97336, y=6487, z=282] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [a=50, counter=48, counter++=47, n=47, x=103823, y=6769, z=288] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [a=50, counter=49, counter++=48, n=48, x=110592, y=7057, z=294] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [a=50, counter=50, counter++=49, n=49, x=117649, y=7351, z=300] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, 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=50, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [a=50, counter=51, counter++=50, n=50, x=125000, y=7651, z=306] [L33] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=50, counter=51, n=50, x=125000, y=7651, z=306] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=51] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 147.6s, OverallIterations: 21, TraceHistogramMax: 252, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1483 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1421 mSDsluCounter, 4212 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2922 mSDsCounter, 1887 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5311 IncrementalHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1887 mSolverCounterUnsat, 1321 mSDtfsCounter, 5311 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9229 GetRequests, 8576 SyntacticMatches, 68 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9341 ImplicationChecksByTransitivity, 63.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1412occurred in iteration=20, InterpolantAutomatonStates: 379, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 4532 NumberOfCodeBlocks, 4357 NumberOfCodeBlocksAsserted, 199 NumberOfCheckSat, 5902 ConstructedInterpolants, 0 QuantifiedInterpolants, 17528 SizeOfPredicates, 111 NumberOfNonLiveVariables, 6699 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 148556/301962 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 03:52:07,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8d2bc8-eb0d-4dd7-a26f-2ee8878df710/bin/utaipan-7li7fVZpFI/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