./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.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_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/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_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/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_ff150884-eebc-46bd-ab88-d9cf46cec628/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 0bd5c2784fe43830be309c722c3fa9fc4d3ef116c17a8343acb2a2dfbcf830c0 --- 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 02:19:20,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:19:20,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:19:20,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:19:20,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:19:20,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:19:20,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:19:20,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:19:20,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:19:20,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:19:20,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:19:20,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:19:20,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:19:20,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:19:20,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:19:20,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:19:20,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:19:20,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:19:20,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:19:20,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:19:20,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:19:20,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:19:20,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:19:20,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:19:20,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:19:20,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:19:20,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:19:20,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:19:20,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:19:20,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:19:20,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:19:20,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:19:20,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:19:20,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:19:20,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:19:20,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:19:20,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:19:20,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:19:20,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:19:20,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:19:20,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:19:20,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:19:20,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:19:20,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:19:20,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:19:20,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:19:20,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:19:20,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:19:20,177 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:19:20,177 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:19:20,177 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:19:20,177 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:19:20,178 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:19:20,179 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:19:20,179 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:19:20,179 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:19:20,179 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:19:20,180 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:19:20,180 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:19:20,180 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:19:20,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:19:20,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:19:20,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:19:20,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:19:20,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:19:20,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:19:20,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:19:20,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:19:20,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:19:20,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:19:20,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:19:20,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:19:20,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:19:20,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:19:20,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:19:20,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:19:20,186 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:19:20,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:19:20,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:19:20,187 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:19:20,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:19:20,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:19:20,188 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:19:20,188 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_ff150884-eebc-46bd-ab88-d9cf46cec628/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_ff150884-eebc-46bd-ab88-d9cf46cec628/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 -> 0bd5c2784fe43830be309c722c3fa9fc4d3ef116c17a8343acb2a2dfbcf830c0 [2022-11-03 02:19:20,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:19:20,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:19:20,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:19:20,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:19:20,511 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:19:20,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c [2022-11-03 02:19:20,573 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/data/36c52c7de/4baa6afcbc0f4564902135d6ac132911/FLAGf046c1239 [2022-11-03 02:19:21,059 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:19:21,060 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c [2022-11-03 02:19:21,067 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/data/36c52c7de/4baa6afcbc0f4564902135d6ac132911/FLAGf046c1239 [2022-11-03 02:19:21,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/data/36c52c7de/4baa6afcbc0f4564902135d6ac132911 [2022-11-03 02:19:21,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:19:21,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:19:21,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:19:21,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:19:21,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:19:21,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164742bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21, skipping insertion in model container [2022-11-03 02:19:21,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:19:21,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:19:21,656 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_ff150884-eebc-46bd-ab88-d9cf46cec628/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586] [2022-11-03 02:19:21,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:19:21,683 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:19:21,694 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_ff150884-eebc-46bd-ab88-d9cf46cec628/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586] [2022-11-03 02:19:21,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:19:21,710 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:19:21,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21 WrapperNode [2022-11-03 02:19:21,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:19:21,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:19:21,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:19:21,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:19:21,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,747 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-11-03 02:19:21,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:19:21,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:19:21,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:19:21,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:19:21,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,769 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:19:21,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:19:21,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:19:21,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:19:21,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (1/1) ... [2022-11-03 02:19:21,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:19:21,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:21,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:19:21,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:19:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:19:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 02:19:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 02:19:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:19:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:19:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:19:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 02:19:21,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 02:19:21,937 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:19:21,939 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:19:22,070 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:19:22,101 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:19:22,101 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:19:22,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:19:22 BoogieIcfgContainer [2022-11-03 02:19:22,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:19:22,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:19:22,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:19:22,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:19:22,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:19:21" (1/3) ... [2022-11-03 02:19:22,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f5541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:19:22, skipping insertion in model container [2022-11-03 02:19:22,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:19:21" (2/3) ... [2022-11-03 02:19:22,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f5541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:19:22, skipping insertion in model container [2022-11-03 02:19:22,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:19:22" (3/3) ... [2022-11-03 02:19:22,112 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound100.c [2022-11-03 02:19:22,129 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:19:22,129 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:19:22,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:19:22,207 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;@703533f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:19:22,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:19:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:19:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:19:22,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:22,243 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:22,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1046920148, now seen corresponding path program 1 times [2022-11-03 02:19:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:22,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424474458] [2022-11-03 02:19:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:22,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:22,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424474458] [2022-11-03 02:19:22,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-03 02:19:22,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583131783] [2022-11-03 02:19:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:22,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:22,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:22,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:19:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:22,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:19:22,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:22,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:19:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583131783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:19:22,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:19:22,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:19:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582045221] [2022-11-03 02:19:22,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:22,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:19:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:22,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:19:22,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:19:22,783 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:19:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:22,839 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-03 02:19:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:19:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-11-03 02:19:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:22,865 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:19:22,874 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:19:22,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:19:22,883 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:22,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:19:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:19:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:19:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:19:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-11-03 02:19:22,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-11-03 02:19:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:22,943 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-03 02:19:22,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:19:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-11-03 02:19:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:19:22,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:22,949 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:22,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:19:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-03 02:19:23,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1317434454, now seen corresponding path program 1 times [2022-11-03 02:19:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672348716] [2022-11-03 02:19:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:23,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672348716] [2022-11-03 02:19:23,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-03 02:19:23,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037716045] [2022-11-03 02:19:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:23,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:23,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:23,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:19:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:23,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:19:23,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:23,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:19:23,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037716045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:19:23,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:19:23,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:19:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676326711] [2022-11-03 02:19:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:23,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:19:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:23,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:19:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:19:23,351 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:19:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:23,377 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-03 02:19:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:19:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-11-03 02:19:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:23,379 INFO L225 Difference]: With dead ends: 26 [2022-11-03 02:19:23,379 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 02:19:23,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:19:23,381 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:23,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:19:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 02:19:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 02:19:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:19:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-03 02:19:23,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2022-11-03 02:19:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:23,390 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-03 02:19:23,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:19:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-03 02:19:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:19:23,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:23,392 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:23,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:23,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1319221914, now seen corresponding path program 1 times [2022-11-03 02:19:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:23,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132706713] [2022-11-03 02:19:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:23,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:23,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653482060] [2022-11-03 02:19:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:23,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:23,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:19:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:23,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:19:23,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:19:24,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:19:24,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:24,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132706713] [2022-11-03 02:19:24,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:24,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653482060] [2022-11-03 02:19:24,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653482060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:19:24,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:19:24,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:19:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457670760] [2022-11-03 02:19:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:24,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:19:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:24,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:19:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:19:24,023 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:19:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:24,162 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-03 02:19:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:19:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-11-03 02:19:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:24,163 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:19:24,164 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:19:24,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:19:24,165 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:24,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:19:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:19:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-03 02:19:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:19:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-03 02:19:24,174 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-11-03 02:19:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:24,174 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-03 02:19:24,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:19:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-03 02:19:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:19:24,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:24,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:24,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:24,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1562521278, now seen corresponding path program 1 times [2022-11-03 02:19:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514316532] [2022-11-03 02:19:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:24,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607121229] [2022-11-03 02:19:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:24,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:24,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:19:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:24,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:19:24,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:24,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:24,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:24,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514316532] [2022-11-03 02:19:24,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:24,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607121229] [2022-11-03 02:19:24,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607121229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [355731267] [2022-11-03 02:19:24,794 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:24,795 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:24,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:24,805 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:24,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:25,352 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-03 02:19:25,371 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:25,428 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:27,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [355731267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:19:27,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:27,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8] total 21 [2022-11-03 02:19:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973618883] [2022-11-03 02:19:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:19:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:19:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:19:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:19:27,041 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:19:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:27,192 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-11-03 02:19:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:19:27,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-11-03 02:19:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:27,194 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:19:27,194 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:19:27,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:19:27,196 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:27,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 18 Unchecked, 0.1s Time] [2022-11-03 02:19:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:19:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-03 02:19:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:19:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-03 02:19:27,208 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2022-11-03 02:19:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:27,208 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-03 02:19:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:19:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-03 02:19:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:19:27,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:27,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:27,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:27,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:27,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -182192907, now seen corresponding path program 1 times [2022-11-03 02:19:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:27,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314861842] [2022-11-03 02:19:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:27,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:27,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98681801] [2022-11-03 02:19:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:27,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:27,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:27,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:19:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:27,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:19:27,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:27,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:27,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314861842] [2022-11-03 02:19:27,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98681801] [2022-11-03 02:19:27,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98681801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360625016] [2022-11-03 02:19:27,618 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:27,618 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:27,619 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:27,619 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:27,619 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:28,389 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2022-11-03 02:19:28,604 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:28,641 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:29,853 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '705#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 02:19:29,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:29,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:29,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-03 02:19:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72518716] [2022-11-03 02:19:29,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:29,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:19:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:19:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:19:29,855 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:19:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:29,963 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-11-03 02:19:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:19:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2022-11-03 02:19:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:29,965 INFO L225 Difference]: With dead ends: 56 [2022-11-03 02:19:29,965 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 02:19:29,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:19:29,966 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:29,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:19:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 02:19:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-11-03 02:19:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:19:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-11-03 02:19:29,980 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2022-11-03 02:19:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:29,980 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-11-03 02:19:29,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 02:19:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-11-03 02:19:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:19:29,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:29,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:30,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:30,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash -180405447, now seen corresponding path program 1 times [2022-11-03 02:19:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:30,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871252162] [2022-11-03 02:19:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:30,226 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:30,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643493221] [2022-11-03 02:19:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:30,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:30,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:30,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:19:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:30,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:19:30,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:30,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:30,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871252162] [2022-11-03 02:19:30,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643493221] [2022-11-03 02:19:30,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643493221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1702825621] [2022-11-03 02:19:30,647 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:19:30,647 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:30,647 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:30,648 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:30,648 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:31,254 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 37 for LOIs [2022-11-03 02:19:31,311 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:31,343 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:32,370 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1002#(and (< ~counter~0 101) (= |__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 02:19:32,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:32,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:32,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-03 02:19:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686625899] [2022-11-03 02:19:32,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:32,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:19:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:19:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:19:32,372 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:19:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:32,496 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-11-03 02:19:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:19:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-11-03 02:19:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:32,498 INFO L225 Difference]: With dead ends: 59 [2022-11-03 02:19:32,498 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 02:19:32,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:19:32,499 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:32,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 63 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:19:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 02:19:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-11-03 02:19:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:19:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-03 02:19:32,511 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2022-11-03 02:19:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:32,511 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-03 02:19:32,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:19:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-03 02:19:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:19:32,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:32,513 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:32,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 02:19:32,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 02:19:32,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:32,727 INFO L85 PathProgramCache]: Analyzing trace with hash 408559265, now seen corresponding path program 1 times [2022-11-03 02:19:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:32,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207255711] [2022-11-03 02:19:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:32,738 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:32,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513374743] [2022-11-03 02:19:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:32,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:32,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:19:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:32,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:19:32,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:19:32,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:19:32,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207255711] [2022-11-03 02:19:32,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:32,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513374743] [2022-11-03 02:19:32,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513374743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:32,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [473149266] [2022-11-03 02:19:32,988 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:32,988 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:32,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:32,990 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:32,990 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:33,876 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 02:19:33,882 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:33,913 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:34,982 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1335#(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 02:19:34,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:34,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:34,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-03 02:19:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23601400] [2022-11-03 02:19:34,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:34,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:19:34,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:19:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:19:34,985 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 02:19:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:35,092 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-11-03 02:19:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:19:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-11-03 02:19:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:35,095 INFO L225 Difference]: With dead ends: 50 [2022-11-03 02:19:35,095 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 02:19:35,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:19:35,098 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:35,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 57 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:19:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 02:19:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 02:19:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:19:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-11-03 02:19:35,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 28 [2022-11-03 02:19:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:35,121 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-11-03 02:19:35,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 02:19:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-11-03 02:19:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:19:35,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:35,126 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:35,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:35,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:35,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash -235004718, now seen corresponding path program 2 times [2022-11-03 02:19:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:35,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033616124] [2022-11-03 02:19:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:35,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:35,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841908843] [2022-11-03 02:19:35,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:19:35,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:35,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:35,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:35,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:19:35,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 02:19:35,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:35,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:19:35,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:35,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:19:35,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:35,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033616124] [2022-11-03 02:19:35,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:35,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841908843] [2022-11-03 02:19:35,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841908843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222162442] [2022-11-03 02:19:35,713 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:35,713 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:35,713 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:35,714 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:35,714 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:36,548 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 02:19:36,555 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:36,581 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:37,432 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1770#(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 02:19:37,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:37,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:37,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-03 02:19:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578270138] [2022-11-03 02:19:37,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:37,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:19:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:19:37,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:19:37,436 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-03 02:19:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:37,744 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-11-03 02:19:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:19:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 46 [2022-11-03 02:19:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:37,749 INFO L225 Difference]: With dead ends: 98 [2022-11-03 02:19:37,750 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 02:19:37,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:19:37,752 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:37,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 128 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:19:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 02:19:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-03 02:19:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-03 02:19:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-11-03 02:19:37,784 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 46 [2022-11-03 02:19:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:37,784 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-11-03 02:19:37,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-03 02:19:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-11-03 02:19:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-03 02:19:37,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:37,791 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:37,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:37,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:37,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1419782260, now seen corresponding path program 3 times [2022-11-03 02:19:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:37,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456295732] [2022-11-03 02:19:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:38,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:38,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612038201] [2022-11-03 02:19:38,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:19:38,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:38,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:38,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:19:38,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:19:38,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:38,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:19:38,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:38,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-11-03 02:19:38,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:38,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456295732] [2022-11-03 02:19:38,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612038201] [2022-11-03 02:19:38,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612038201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1927730635] [2022-11-03 02:19:38,722 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:38,723 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:38,723 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:38,723 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:38,723 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:39,479 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 02:19:39,485 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:39,510 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:40,326 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2650#(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 02:19:40,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:40,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-03 02:19:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352639376] [2022-11-03 02:19:40,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:40,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 02:19:40,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:40,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 02:19:40,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1048, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 02:19:40,329 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-03 02:19:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:40,977 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2022-11-03 02:19:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 02:19:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 94 [2022-11-03 02:19:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:40,979 INFO L225 Difference]: With dead ends: 194 [2022-11-03 02:19:40,979 INFO L226 Difference]: Without dead ends: 189 [2022-11-03 02:19:40,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=949, Invalid=2591, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 02:19:40,981 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:40,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 161 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:19:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-03 02:19:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-03 02:19:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0071428571428571) internal successors, (141), 140 states have internal predecessors, (141), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-03 02:19:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2022-11-03 02:19:41,025 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 94 [2022-11-03 02:19:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:41,028 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2022-11-03 02:19:41,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-03 02:19:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2022-11-03 02:19:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-03 02:19:41,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:41,037 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:41,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:41,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:41,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1763378944, now seen corresponding path program 4 times [2022-11-03 02:19:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:41,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760217045] [2022-11-03 02:19:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:41,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342057581] [2022-11-03 02:19:41,290 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:19:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:41,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:41,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:19:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:41,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:19:41,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:42,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2022-11-03 02:19:42,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760217045] [2022-11-03 02:19:42,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342057581] [2022-11-03 02:19:42,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342057581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1813054964] [2022-11-03 02:19:42,972 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:42,972 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:42,973 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:42,973 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:42,973 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:43,674 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 02:19:43,679 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:43,705 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:44,586 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4418#(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 02:19:44,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:44,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:44,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-03 02:19:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951386782] [2022-11-03 02:19:44,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:44,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:19:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:44,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:19:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=2500, Unknown=0, NotChecked=0, Total=3906 [2022-11-03 02:19:44,591 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-03 02:19:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:46,368 INFO L93 Difference]: Finished difference Result 386 states and 410 transitions. [2022-11-03 02:19:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-03 02:19:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 190 [2022-11-03 02:19:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:46,372 INFO L225 Difference]: With dead ends: 386 [2022-11-03 02:19:46,372 INFO L226 Difference]: Without dead ends: 381 [2022-11-03 02:19:46,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3589, Invalid=7967, Unknown=0, NotChecked=0, Total=11556 [2022-11-03 02:19:46,376 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 604 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:46,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 276 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:19:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-03 02:19:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-03 02:19:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 284 states have (on average 1.0035211267605635) internal successors, (285), 284 states have internal predecessors, (285), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-03 02:19:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2022-11-03 02:19:46,418 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 190 [2022-11-03 02:19:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:46,419 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2022-11-03 02:19:46,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-03 02:19:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2022-11-03 02:19:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-11-03 02:19:46,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:46,425 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:46,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:46,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:19:46,635 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:19:46,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1767238632, now seen corresponding path program 5 times [2022-11-03 02:19:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:46,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223238018] [2022-11-03 02:19:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:46,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:19:46,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757030290] [2022-11-03 02:19:46,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:19:46,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:46,663 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:46,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:19:47,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-03 02:19:47,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:47,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-03 02:19:47,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:19:48,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2022-11-03 02:19:52,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223238018] [2022-11-03 02:19:52,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:19:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757030290] [2022-11-03 02:19:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757030290] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088970790] [2022-11-03 02:19:52,069 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:19:52,069 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:19:52,069 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:19:52,069 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:19:52,069 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:19:52,800 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 02:19:52,804 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:19:52,827 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:19:53,791 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7962#(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 02:19:53,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:19:53,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:19:53,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2022-11-03 02:19:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125731557] [2022-11-03 02:19:53,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:53,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-03 02:19:53,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-03 02:19:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=7132, Unknown=0, NotChecked=0, Total=12210 [2022-11-03 02:19:53,798 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2022-11-03 02:19:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:59,915 INFO L93 Difference]: Finished difference Result 770 states and 818 transitions. [2022-11-03 02:19:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-11-03 02:19:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) Word has length 382 [2022-11-03 02:19:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:59,921 INFO L225 Difference]: With dead ends: 770 [2022-11-03 02:19:59,921 INFO L226 Difference]: Without dead ends: 765 [2022-11-03 02:19:59,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8486 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=14053, Invalid=27359, Unknown=0, NotChecked=0, Total=41412 [2022-11-03 02:19:59,930 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 1670 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:59,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 627 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:19:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-03 02:19:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2022-11-03 02:19:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 572 states have (on average 1.0017482517482517) internal successors, (573), 572 states have internal predecessors, (573), 97 states have call successors, (97), 96 states have call predecessors, (97), 95 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-11-03 02:20:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 766 transitions. [2022-11-03 02:20:00,001 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 766 transitions. Word has length 382 [2022-11-03 02:20:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:00,002 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 766 transitions. [2022-11-03 02:20:00,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2022-11-03 02:20:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 766 transitions. [2022-11-03 02:20:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2022-11-03 02:20:00,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:00,026 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:00,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:00,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:00,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:20:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1053987256, now seen corresponding path program 6 times [2022-11-03 02:20:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:00,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495060164] [2022-11-03 02:20:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:00,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:20:00,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623002612] [2022-11-03 02:20:00,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:20:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:00,278 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:20:00,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:20:01,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:20:01,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:20:01,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 191 conjunts are in the unsatisfiable core [2022-11-03 02:20:01,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:20:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 35346 backedges. 188 proven. 35156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:20:05,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:20:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 35346 backedges. 188 proven. 17672 refuted. 0 times theorem prover too weak. 17486 trivial. 0 not checked. [2022-11-03 02:20:10,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:10,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495060164] [2022-11-03 02:20:10,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:20:10,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623002612] [2022-11-03 02:20:10,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623002612] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:20:10,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [952265129] [2022-11-03 02:20:10,817 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:20:10,818 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:20:10,818 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:20:10,818 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:20:10,818 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:20:11,486 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2022-11-03 02:20:11,490 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 70 for LOIs [2022-11-03 02:20:11,512 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:20:12,815 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14968#(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 02:20:12,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:20:12,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:20:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2022-11-03 02:20:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054617259] [2022-11-03 02:20:12,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:20:12,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-03 02:20:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-03 02:20:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5699, Invalid=7873, Unknown=0, NotChecked=0, Total=13572 [2022-11-03 02:20:12,822 INFO L87 Difference]: Start difference. First operand 765 states and 766 transitions. Second operand has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) [2022-11-03 02:20:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:18,748 INFO L93 Difference]: Finished difference Result 818 states and 824 transitions. [2022-11-03 02:20:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-03 02:20:18,751 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) Word has length 766 [2022-11-03 02:20:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:18,756 INFO L225 Difference]: With dead ends: 818 [2022-11-03 02:20:18,757 INFO L226 Difference]: Without dead ends: 813 [2022-11-03 02:20:18,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2395 GetRequests, 2091 SyntacticMatches, 90 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12371 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=15892, Invalid=30548, Unknown=0, NotChecked=0, Total=46440 [2022-11-03 02:20:18,764 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 597 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:18,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 668 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:20:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-11-03 02:20:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2022-11-03 02:20:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 608 states have (on average 1.0016447368421053) internal successors, (609), 608 states have internal predecessors, (609), 103 states have call successors, (103), 102 states have call predecessors, (103), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-11-03 02:20:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 814 transitions. [2022-11-03 02:20:18,827 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 814 transitions. Word has length 766 [2022-11-03 02:20:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:18,829 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 814 transitions. [2022-11-03 02:20:18,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) [2022-11-03 02:20:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 814 transitions. [2022-11-03 02:20:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2022-11-03 02:20:18,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:18,859 INFO L195 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:18,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:20:19,075 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:20:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1872537714, now seen corresponding path program 7 times [2022-11-03 02:20:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:19,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767274328] [2022-11-03 02:20:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:19,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:20:19,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737593702] [2022-11-03 02:20:19,117 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:20:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:19,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:19,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:20:19,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:20:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:20:20,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:20:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:20:22,321 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:20:22,321 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:20:22,323 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:20:22,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:22,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:22,542 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:22,546 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:20:22,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:20:22 BoogieIcfgContainer [2022-11-03 02:20:22,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:20:22,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:20:22,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:20:22,742 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:20:22,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:19:22" (3/4) ... [2022-11-03 02:20:22,745 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:20:22,987 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:20:22,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:20:22,988 INFO L158 Benchmark]: Toolchain (without parser) took 61542.77ms. Allocated memory was 100.7MB in the beginning and 469.8MB in the end (delta: 369.1MB). Free memory was 70.0MB in the beginning and 368.3MB in the end (delta: -298.3MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2022-11-03 02:20:22,988 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 100.7MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:20:22,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 72.8MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:20:22,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.82ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:20:22,990 INFO L158 Benchmark]: Boogie Preprocessor took 24.04ms. Allocated memory is still 100.7MB. Free memory was 71.4MB in the beginning and 70.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:20:22,990 INFO L158 Benchmark]: RCFGBuilder took 330.70ms. Allocated memory is still 100.7MB. Free memory was 70.2MB in the beginning and 58.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:20:22,991 INFO L158 Benchmark]: TraceAbstraction took 60636.14ms. Allocated memory was 100.7MB in the beginning and 469.8MB in the end (delta: 369.1MB). Free memory was 57.9MB in the beginning and 396.6MB in the end (delta: -338.7MB). Peak memory consumption was 274.1MB. Max. memory is 16.1GB. [2022-11-03 02:20:22,991 INFO L158 Benchmark]: Witness Printer took 245.50ms. Allocated memory is still 469.8MB. Free memory was 396.6MB in the beginning and 368.3MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-03 02:20:22,995 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.24ms. Allocated memory is still 100.7MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 72.8MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.82ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.04ms. Allocated memory is still 100.7MB. Free memory was 71.4MB in the beginning and 70.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 330.70ms. Allocated memory is still 100.7MB. Free memory was 70.2MB in the beginning and 58.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 60636.14ms. Allocated memory was 100.7MB in the beginning and 469.8MB in the end (delta: 369.1MB). Free memory was 57.9MB in the beginning and 396.6MB in the end (delta: -338.7MB). Peak memory consumption was 274.1MB. Max. memory is 16.1GB. * Witness Printer took 245.50ms. Allocated memory is still 469.8MB. Free memory was 396.6MB in the beginning and 368.3MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=101, x2=5] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=101, x2=5] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=101, x2=5, y1=0, y2=0, y3=101] [L36] EXPR counter++ VAL [counter=1, counter++=0, x1=101, x2=5, y1=0, y2=0, y3=101] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=101, x2=5, y1=0, y2=0, y3=101] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=1, x1=101, x2=5, y1=0, y2=1, y3=100] [L36] EXPR counter++ VAL [counter=2, counter++=1, x1=101, x2=5, y1=0, y2=1, y3=100] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=101, x2=5, y1=0, y2=1, y3=100] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=2, x1=101, x2=5, y1=0, y2=2, y3=99] [L36] EXPR counter++ VAL [counter=3, counter++=2, x1=101, x2=5, y1=0, y2=2, y3=99] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=101, x2=5, y1=0, y2=2, y3=99] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=3, x1=101, x2=5, y1=0, y2=3, y3=98] [L36] EXPR counter++ VAL [counter=4, counter++=3, x1=101, x2=5, y1=0, y2=3, y3=98] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=101, x2=5, y1=0, y2=3, y3=98] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=4, x1=101, x2=5, y1=0, y2=4, y3=97] [L36] EXPR counter++ VAL [counter=5, counter++=4, x1=101, x2=5, y1=0, y2=4, y3=97] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=101, x2=5, y1=0, y2=4, y3=97] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=101, x2=5, y1=1, y2=0, y3=96] [L36] EXPR counter++ VAL [counter=6, counter++=5, x1=101, x2=5, y1=1, y2=0, y3=96] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=101, x2=5, y1=1, y2=0, y3=96] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=6, x1=101, x2=5, y1=1, y2=1, y3=95] [L36] EXPR counter++ VAL [counter=7, counter++=6, x1=101, x2=5, y1=1, y2=1, y3=95] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=101, x2=5, y1=1, y2=1, y3=95] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=7, x1=101, x2=5, y1=1, y2=2, y3=94] [L36] EXPR counter++ VAL [counter=8, counter++=7, x1=101, x2=5, y1=1, y2=2, y3=94] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=101, x2=5, y1=1, y2=2, y3=94] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=8, x1=101, x2=5, y1=1, y2=3, y3=93] [L36] EXPR counter++ VAL [counter=9, counter++=8, x1=101, x2=5, y1=1, y2=3, y3=93] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=101, x2=5, y1=1, y2=3, y3=93] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=9, x1=101, x2=5, y1=1, y2=4, y3=92] [L36] EXPR counter++ VAL [counter=10, counter++=9, x1=101, x2=5, y1=1, y2=4, y3=92] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=101, x2=5, y1=1, y2=4, y3=92] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=101, x2=5, y1=2, y2=0, y3=91] [L36] EXPR counter++ VAL [counter=11, counter++=10, x1=101, x2=5, y1=2, y2=0, y3=91] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=101, x2=5, y1=2, y2=0, y3=91] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=11, x1=101, x2=5, y1=2, y2=1, y3=90] [L36] EXPR counter++ VAL [counter=12, counter++=11, x1=101, x2=5, y1=2, y2=1, y3=90] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=101, x2=5, y1=2, y2=1, y3=90] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=12, x1=101, x2=5, y1=2, y2=2, y3=89] [L36] EXPR counter++ VAL [counter=13, counter++=12, x1=101, x2=5, y1=2, y2=2, y3=89] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=101, x2=5, y1=2, y2=2, y3=89] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=13, x1=101, x2=5, y1=2, y2=3, y3=88] [L36] EXPR counter++ VAL [counter=14, counter++=13, x1=101, x2=5, y1=2, y2=3, y3=88] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=101, x2=5, y1=2, y2=3, y3=88] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=14, x1=101, x2=5, y1=2, y2=4, y3=87] [L36] EXPR counter++ VAL [counter=15, counter++=14, x1=101, x2=5, y1=2, y2=4, y3=87] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=101, x2=5, y1=2, y2=4, y3=87] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=101, x2=5, y1=3, y2=0, y3=86] [L36] EXPR counter++ VAL [counter=16, counter++=15, x1=101, x2=5, y1=3, y2=0, y3=86] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=101, x2=5, y1=3, y2=0, y3=86] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=16, x1=101, x2=5, y1=3, y2=1, y3=85] [L36] EXPR counter++ VAL [counter=17, counter++=16, x1=101, x2=5, y1=3, y2=1, y3=85] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=101, x2=5, y1=3, y2=1, y3=85] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=17, x1=101, x2=5, y1=3, y2=2, y3=84] [L36] EXPR counter++ VAL [counter=18, counter++=17, x1=101, x2=5, y1=3, y2=2, y3=84] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=101, x2=5, y1=3, y2=2, y3=84] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=18, x1=101, x2=5, y1=3, y2=3, y3=83] [L36] EXPR counter++ VAL [counter=19, counter++=18, x1=101, x2=5, y1=3, y2=3, y3=83] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=101, x2=5, y1=3, y2=3, y3=83] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=19, x1=101, x2=5, y1=3, y2=4, y3=82] [L36] EXPR counter++ VAL [counter=20, counter++=19, x1=101, x2=5, y1=3, y2=4, y3=82] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=101, x2=5, y1=3, y2=4, y3=82] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=101, x2=5, y1=4, y2=0, y3=81] [L36] EXPR counter++ VAL [counter=21, counter++=20, x1=101, x2=5, y1=4, y2=0, y3=81] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=21] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=21, x1=101, x2=5, y1=4, y2=0, y3=81] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=21, x1=101, x2=5, y1=4, y2=1, y3=80] [L36] EXPR counter++ VAL [counter=22, counter++=21, x1=101, x2=5, y1=4, y2=1, y3=80] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=22] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=22, x1=101, x2=5, y1=4, y2=1, y3=80] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=22, x1=101, x2=5, y1=4, y2=2, y3=79] [L36] EXPR counter++ VAL [counter=23, counter++=22, x1=101, x2=5, y1=4, y2=2, y3=79] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=23] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=23, x1=101, x2=5, y1=4, y2=2, y3=79] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=23, x1=101, x2=5, y1=4, y2=3, y3=78] [L36] EXPR counter++ VAL [counter=24, counter++=23, x1=101, x2=5, y1=4, y2=3, y3=78] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=24] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=24, x1=101, x2=5, y1=4, y2=3, y3=78] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=24, x1=101, x2=5, y1=4, y2=4, y3=77] [L36] EXPR counter++ VAL [counter=25, counter++=24, x1=101, x2=5, y1=4, y2=4, y3=77] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=25] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=25, x1=101, x2=5, y1=4, y2=4, y3=77] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=25, x1=101, x2=5, y1=5, y2=0, y3=76] [L36] EXPR counter++ VAL [counter=26, counter++=25, x1=101, x2=5, y1=5, y2=0, y3=76] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=26] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=26, x1=101, x2=5, y1=5, y2=0, y3=76] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=26, x1=101, x2=5, y1=5, y2=1, y3=75] [L36] EXPR counter++ VAL [counter=27, counter++=26, x1=101, x2=5, y1=5, y2=1, y3=75] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=27] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=27, x1=101, x2=5, y1=5, y2=1, y3=75] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=27, x1=101, x2=5, y1=5, y2=2, y3=74] [L36] EXPR counter++ VAL [counter=28, counter++=27, x1=101, x2=5, y1=5, y2=2, y3=74] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=28] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=28, x1=101, x2=5, y1=5, y2=2, y3=74] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=28, x1=101, x2=5, y1=5, y2=3, y3=73] [L36] EXPR counter++ VAL [counter=29, counter++=28, x1=101, x2=5, y1=5, y2=3, y3=73] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=29] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=29, x1=101, x2=5, y1=5, y2=3, y3=73] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=29, x1=101, x2=5, y1=5, y2=4, y3=72] [L36] EXPR counter++ VAL [counter=30, counter++=29, x1=101, x2=5, y1=5, y2=4, y3=72] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=30] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=30, x1=101, x2=5, y1=5, y2=4, y3=72] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=30, x1=101, x2=5, y1=6, y2=0, y3=71] [L36] EXPR counter++ VAL [counter=31, counter++=30, x1=101, x2=5, y1=6, y2=0, y3=71] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=31] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=31, x1=101, x2=5, y1=6, y2=0, y3=71] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=31, x1=101, x2=5, y1=6, y2=1, y3=70] [L36] EXPR counter++ VAL [counter=32, counter++=31, x1=101, x2=5, y1=6, y2=1, y3=70] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=32] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=32, x1=101, x2=5, y1=6, y2=1, y3=70] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=32, x1=101, x2=5, y1=6, y2=2, y3=69] [L36] EXPR counter++ VAL [counter=33, counter++=32, x1=101, x2=5, y1=6, y2=2, y3=69] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=33] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=33, x1=101, x2=5, y1=6, y2=2, y3=69] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=33, x1=101, x2=5, y1=6, y2=3, y3=68] [L36] EXPR counter++ VAL [counter=34, counter++=33, x1=101, x2=5, y1=6, y2=3, y3=68] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=34] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=34, x1=101, x2=5, y1=6, y2=3, y3=68] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=34, x1=101, x2=5, y1=6, y2=4, y3=67] [L36] EXPR counter++ VAL [counter=35, counter++=34, x1=101, x2=5, y1=6, y2=4, y3=67] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=35] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=35, x1=101, x2=5, y1=6, y2=4, y3=67] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=35, x1=101, x2=5, y1=7, y2=0, y3=66] [L36] EXPR counter++ VAL [counter=36, counter++=35, x1=101, x2=5, y1=7, y2=0, y3=66] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=36] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=36, x1=101, x2=5, y1=7, y2=0, y3=66] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=36, x1=101, x2=5, y1=7, y2=1, y3=65] [L36] EXPR counter++ VAL [counter=37, counter++=36, x1=101, x2=5, y1=7, y2=1, y3=65] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=37] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=37, x1=101, x2=5, y1=7, y2=1, y3=65] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=37, x1=101, x2=5, y1=7, y2=2, y3=64] [L36] EXPR counter++ VAL [counter=38, counter++=37, x1=101, x2=5, y1=7, y2=2, y3=64] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=38] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=38, x1=101, x2=5, y1=7, y2=2, y3=64] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=38, x1=101, x2=5, y1=7, y2=3, y3=63] [L36] EXPR counter++ VAL [counter=39, counter++=38, x1=101, x2=5, y1=7, y2=3, y3=63] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=39] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=39, x1=101, x2=5, y1=7, y2=3, y3=63] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=39, x1=101, x2=5, y1=7, y2=4, y3=62] [L36] EXPR counter++ VAL [counter=40, counter++=39, x1=101, x2=5, y1=7, y2=4, y3=62] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=40] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=40, x1=101, x2=5, y1=7, y2=4, y3=62] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=40, x1=101, x2=5, y1=8, y2=0, y3=61] [L36] EXPR counter++ VAL [counter=41, counter++=40, x1=101, x2=5, y1=8, y2=0, y3=61] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=41] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=41, x1=101, x2=5, y1=8, y2=0, y3=61] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=41, x1=101, x2=5, y1=8, y2=1, y3=60] [L36] EXPR counter++ VAL [counter=42, counter++=41, x1=101, x2=5, y1=8, y2=1, y3=60] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=42] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=42, x1=101, x2=5, y1=8, y2=1, y3=60] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=42, x1=101, x2=5, y1=8, y2=2, y3=59] [L36] EXPR counter++ VAL [counter=43, counter++=42, x1=101, x2=5, y1=8, y2=2, y3=59] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=43] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=43, x1=101, x2=5, y1=8, y2=2, y3=59] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=43, x1=101, x2=5, y1=8, y2=3, y3=58] [L36] EXPR counter++ VAL [counter=44, counter++=43, x1=101, x2=5, y1=8, y2=3, y3=58] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=44] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=44, x1=101, x2=5, y1=8, y2=3, y3=58] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=44, x1=101, x2=5, y1=8, y2=4, y3=57] [L36] EXPR counter++ VAL [counter=45, counter++=44, x1=101, x2=5, y1=8, y2=4, y3=57] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=45] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=45, x1=101, x2=5, y1=8, y2=4, y3=57] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=45, x1=101, x2=5, y1=9, y2=0, y3=56] [L36] EXPR counter++ VAL [counter=46, counter++=45, x1=101, x2=5, y1=9, y2=0, y3=56] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=46] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=46, x1=101, x2=5, y1=9, y2=0, y3=56] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=46, x1=101, x2=5, y1=9, y2=1, y3=55] [L36] EXPR counter++ VAL [counter=47, counter++=46, x1=101, x2=5, y1=9, y2=1, y3=55] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=47] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=47, x1=101, x2=5, y1=9, y2=1, y3=55] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=47, x1=101, x2=5, y1=9, y2=2, y3=54] [L36] EXPR counter++ VAL [counter=48, counter++=47, x1=101, x2=5, y1=9, y2=2, y3=54] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=48] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=48, x1=101, x2=5, y1=9, y2=2, y3=54] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=48, x1=101, x2=5, y1=9, y2=3, y3=53] [L36] EXPR counter++ VAL [counter=49, counter++=48, x1=101, x2=5, y1=9, y2=3, y3=53] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=49] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=49, x1=101, x2=5, y1=9, y2=3, y3=53] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=49, x1=101, x2=5, y1=9, y2=4, y3=52] [L36] EXPR counter++ VAL [counter=50, counter++=49, x1=101, x2=5, y1=9, y2=4, y3=52] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=50] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=50, x1=101, x2=5, y1=9, y2=4, y3=52] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=50, x1=101, x2=5, y1=10, y2=0, y3=51] [L36] EXPR counter++ VAL [counter=51, counter++=50, x1=101, x2=5, y1=10, y2=0, y3=51] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=51] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=51, x1=101, x2=5, y1=10, y2=0, y3=51] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=51, x1=101, x2=5, y1=10, y2=1, y3=50] [L36] EXPR counter++ VAL [counter=52, counter++=51, x1=101, x2=5, y1=10, y2=1, y3=50] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=52] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=52, x1=101, x2=5, y1=10, y2=1, y3=50] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=52, x1=101, x2=5, y1=10, y2=2, y3=49] [L36] EXPR counter++ VAL [counter=53, counter++=52, x1=101, x2=5, y1=10, y2=2, y3=49] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=53] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=53, x1=101, x2=5, y1=10, y2=2, y3=49] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=53, x1=101, x2=5, y1=10, y2=3, y3=48] [L36] EXPR counter++ VAL [counter=54, counter++=53, x1=101, x2=5, y1=10, y2=3, y3=48] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=54] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=54, x1=101, x2=5, y1=10, y2=3, y3=48] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=54, x1=101, x2=5, y1=10, y2=4, y3=47] [L36] EXPR counter++ VAL [counter=55, counter++=54, x1=101, x2=5, y1=10, y2=4, y3=47] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=55] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=55, x1=101, x2=5, y1=10, y2=4, y3=47] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=55, x1=101, x2=5, y1=11, y2=0, y3=46] [L36] EXPR counter++ VAL [counter=56, counter++=55, x1=101, x2=5, y1=11, y2=0, y3=46] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=56] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=56, x1=101, x2=5, y1=11, y2=0, y3=46] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=56, x1=101, x2=5, y1=11, y2=1, y3=45] [L36] EXPR counter++ VAL [counter=57, counter++=56, x1=101, x2=5, y1=11, y2=1, y3=45] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=57] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=57, x1=101, x2=5, y1=11, y2=1, y3=45] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=57, x1=101, x2=5, y1=11, y2=2, y3=44] [L36] EXPR counter++ VAL [counter=58, counter++=57, x1=101, x2=5, y1=11, y2=2, y3=44] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=58] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=58, x1=101, x2=5, y1=11, y2=2, y3=44] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=58, x1=101, x2=5, y1=11, y2=3, y3=43] [L36] EXPR counter++ VAL [counter=59, counter++=58, x1=101, x2=5, y1=11, y2=3, y3=43] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=59] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=59, x1=101, x2=5, y1=11, y2=3, y3=43] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=59, x1=101, x2=5, y1=11, y2=4, y3=42] [L36] EXPR counter++ VAL [counter=60, counter++=59, x1=101, x2=5, y1=11, y2=4, y3=42] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=60] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=60, x1=101, x2=5, y1=11, y2=4, y3=42] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=60, x1=101, x2=5, y1=12, y2=0, y3=41] [L36] EXPR counter++ VAL [counter=61, counter++=60, x1=101, x2=5, y1=12, y2=0, y3=41] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=61] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=61, x1=101, x2=5, y1=12, y2=0, y3=41] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=61, x1=101, x2=5, y1=12, y2=1, y3=40] [L36] EXPR counter++ VAL [counter=62, counter++=61, x1=101, x2=5, y1=12, y2=1, y3=40] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=62] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=62, x1=101, x2=5, y1=12, y2=1, y3=40] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=62, x1=101, x2=5, y1=12, y2=2, y3=39] [L36] EXPR counter++ VAL [counter=63, counter++=62, x1=101, x2=5, y1=12, y2=2, y3=39] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=63] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=63, x1=101, x2=5, y1=12, y2=2, y3=39] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=63, x1=101, x2=5, y1=12, y2=3, y3=38] [L36] EXPR counter++ VAL [counter=64, counter++=63, x1=101, x2=5, y1=12, y2=3, y3=38] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=64] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=64, x1=101, x2=5, y1=12, y2=3, y3=38] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=64, x1=101, x2=5, y1=12, y2=4, y3=37] [L36] EXPR counter++ VAL [counter=65, counter++=64, x1=101, x2=5, y1=12, y2=4, y3=37] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=65] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=65, x1=101, x2=5, y1=12, y2=4, y3=37] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=65, x1=101, x2=5, y1=13, y2=0, y3=36] [L36] EXPR counter++ VAL [counter=66, counter++=65, x1=101, x2=5, y1=13, y2=0, y3=36] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=66] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=66, x1=101, x2=5, y1=13, y2=0, y3=36] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=66, x1=101, x2=5, y1=13, y2=1, y3=35] [L36] EXPR counter++ VAL [counter=67, counter++=66, x1=101, x2=5, y1=13, y2=1, y3=35] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=67] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=67, x1=101, x2=5, y1=13, y2=1, y3=35] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=67, x1=101, x2=5, y1=13, y2=2, y3=34] [L36] EXPR counter++ VAL [counter=68, counter++=67, x1=101, x2=5, y1=13, y2=2, y3=34] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=68] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=68, x1=101, x2=5, y1=13, y2=2, y3=34] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=68, x1=101, x2=5, y1=13, y2=3, y3=33] [L36] EXPR counter++ VAL [counter=69, counter++=68, x1=101, x2=5, y1=13, y2=3, y3=33] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=69] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=69, x1=101, x2=5, y1=13, y2=3, y3=33] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=69, x1=101, x2=5, y1=13, y2=4, y3=32] [L36] EXPR counter++ VAL [counter=70, counter++=69, x1=101, x2=5, y1=13, y2=4, y3=32] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=70] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=70, x1=101, x2=5, y1=13, y2=4, y3=32] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=70, x1=101, x2=5, y1=14, y2=0, y3=31] [L36] EXPR counter++ VAL [counter=71, counter++=70, x1=101, x2=5, y1=14, y2=0, y3=31] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=71] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=71, x1=101, x2=5, y1=14, y2=0, y3=31] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=71, x1=101, x2=5, y1=14, y2=1, y3=30] [L36] EXPR counter++ VAL [counter=72, counter++=71, x1=101, x2=5, y1=14, y2=1, y3=30] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=72] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=72, x1=101, x2=5, y1=14, y2=1, y3=30] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=72, x1=101, x2=5, y1=14, y2=2, y3=29] [L36] EXPR counter++ VAL [counter=73, counter++=72, x1=101, x2=5, y1=14, y2=2, y3=29] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=73] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=73, x1=101, x2=5, y1=14, y2=2, y3=29] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=73, x1=101, x2=5, y1=14, y2=3, y3=28] [L36] EXPR counter++ VAL [counter=74, counter++=73, x1=101, x2=5, y1=14, y2=3, y3=28] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=74] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=74, x1=101, x2=5, y1=14, y2=3, y3=28] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=74, x1=101, x2=5, y1=14, y2=4, y3=27] [L36] EXPR counter++ VAL [counter=75, counter++=74, x1=101, x2=5, y1=14, y2=4, y3=27] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=75] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=75, x1=101, x2=5, y1=14, y2=4, y3=27] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=75, x1=101, x2=5, y1=15, y2=0, y3=26] [L36] EXPR counter++ VAL [counter=76, counter++=75, x1=101, x2=5, y1=15, y2=0, y3=26] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=76] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=76, x1=101, x2=5, y1=15, y2=0, y3=26] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=76, x1=101, x2=5, y1=15, y2=1, y3=25] [L36] EXPR counter++ VAL [counter=77, counter++=76, x1=101, x2=5, y1=15, y2=1, y3=25] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=77] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=77, x1=101, x2=5, y1=15, y2=1, y3=25] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=77, x1=101, x2=5, y1=15, y2=2, y3=24] [L36] EXPR counter++ VAL [counter=78, counter++=77, x1=101, x2=5, y1=15, y2=2, y3=24] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=78] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=78, x1=101, x2=5, y1=15, y2=2, y3=24] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=78, x1=101, x2=5, y1=15, y2=3, y3=23] [L36] EXPR counter++ VAL [counter=79, counter++=78, x1=101, x2=5, y1=15, y2=3, y3=23] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=79] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=79, x1=101, x2=5, y1=15, y2=3, y3=23] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=79, x1=101, x2=5, y1=15, y2=4, y3=22] [L36] EXPR counter++ VAL [counter=80, counter++=79, x1=101, x2=5, y1=15, y2=4, y3=22] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=80] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=80, x1=101, x2=5, y1=15, y2=4, y3=22] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=80, x1=101, x2=5, y1=16, y2=0, y3=21] [L36] EXPR counter++ VAL [counter=81, counter++=80, x1=101, x2=5, y1=16, y2=0, y3=21] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=81] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=81, x1=101, x2=5, y1=16, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=81, x1=101, x2=5, y1=16, y2=1, y3=20] [L36] EXPR counter++ VAL [counter=82, counter++=81, x1=101, x2=5, y1=16, y2=1, y3=20] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=82] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=82, x1=101, x2=5, y1=16, y2=1, y3=20] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=82, x1=101, x2=5, y1=16, y2=2, y3=19] [L36] EXPR counter++ VAL [counter=83, counter++=82, x1=101, x2=5, y1=16, y2=2, y3=19] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=83] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=83, x1=101, x2=5, y1=16, y2=2, y3=19] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=83, x1=101, x2=5, y1=16, y2=3, y3=18] [L36] EXPR counter++ VAL [counter=84, counter++=83, x1=101, x2=5, y1=16, y2=3, y3=18] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=84] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=84, x1=101, x2=5, y1=16, y2=3, y3=18] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=84, x1=101, x2=5, y1=16, y2=4, y3=17] [L36] EXPR counter++ VAL [counter=85, counter++=84, x1=101, x2=5, y1=16, y2=4, y3=17] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=85] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=85, x1=101, x2=5, y1=16, y2=4, y3=17] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=85, x1=101, x2=5, y1=17, y2=0, y3=16] [L36] EXPR counter++ VAL [counter=86, counter++=85, x1=101, x2=5, y1=17, y2=0, y3=16] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=86] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=86, x1=101, x2=5, y1=17, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=86, x1=101, x2=5, y1=17, y2=1, y3=15] [L36] EXPR counter++ VAL [counter=87, counter++=86, x1=101, x2=5, y1=17, y2=1, y3=15] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=87] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=87, x1=101, x2=5, y1=17, y2=1, y3=15] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=87, x1=101, x2=5, y1=17, y2=2, y3=14] [L36] EXPR counter++ VAL [counter=88, counter++=87, x1=101, x2=5, y1=17, y2=2, y3=14] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=88] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=88, x1=101, x2=5, y1=17, y2=2, y3=14] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=88, x1=101, x2=5, y1=17, y2=3, y3=13] [L36] EXPR counter++ VAL [counter=89, counter++=88, x1=101, x2=5, y1=17, y2=3, y3=13] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=89] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=89, x1=101, x2=5, y1=17, y2=3, y3=13] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=89, x1=101, x2=5, y1=17, y2=4, y3=12] [L36] EXPR counter++ VAL [counter=90, counter++=89, x1=101, x2=5, y1=17, y2=4, y3=12] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=90] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=90, x1=101, x2=5, y1=17, y2=4, y3=12] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=90, x1=101, x2=5, y1=18, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=91, counter++=90, x1=101, x2=5, y1=18, y2=0, y3=11] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=91] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=91, x1=101, x2=5, y1=18, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=91, x1=101, x2=5, y1=18, y2=1, y3=10] [L36] EXPR counter++ VAL [counter=92, counter++=91, x1=101, x2=5, y1=18, y2=1, y3=10] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=92] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=92, x1=101, x2=5, y1=18, y2=1, y3=10] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=92, x1=101, x2=5, y1=18, y2=2, y3=9] [L36] EXPR counter++ VAL [counter=93, counter++=92, x1=101, x2=5, y1=18, y2=2, y3=9] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=93] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=93, x1=101, x2=5, y1=18, y2=2, y3=9] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=93, x1=101, x2=5, y1=18, y2=3, y3=8] [L36] EXPR counter++ VAL [counter=94, counter++=93, x1=101, x2=5, y1=18, y2=3, y3=8] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=94] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=94, x1=101, x2=5, y1=18, y2=3, y3=8] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=94, x1=101, x2=5, y1=18, y2=4, y3=7] [L36] EXPR counter++ VAL [counter=95, counter++=94, x1=101, x2=5, y1=18, y2=4, y3=7] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=95] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=95, x1=101, x2=5, y1=18, y2=4, y3=7] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=95, x1=101, x2=5, y1=19, y2=0, y3=6] [L36] EXPR counter++ VAL [counter=96, counter++=95, x1=101, x2=5, y1=19, y2=0, y3=6] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=96] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=96, x1=101, x2=5, y1=19, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=96, x1=101, x2=5, y1=19, y2=1, y3=5] [L36] EXPR counter++ VAL [counter=97, counter++=96, x1=101, x2=5, y1=19, y2=1, y3=5] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=97] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=97, x1=101, x2=5, y1=19, y2=1, y3=5] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=97, x1=101, x2=5, y1=19, y2=2, y3=4] [L36] EXPR counter++ VAL [counter=98, counter++=97, x1=101, x2=5, y1=19, y2=2, y3=4] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=98] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=98, x1=101, x2=5, y1=19, y2=2, y3=4] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=98, x1=101, x2=5, y1=19, y2=3, y3=3] [L36] EXPR counter++ VAL [counter=99, counter++=98, x1=101, x2=5, y1=19, y2=3, y3=3] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=99] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=99, x1=101, x2=5, y1=19, y2=3, y3=3] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=99, x1=101, x2=5, y1=19, y2=4, y3=2] [L36] EXPR counter++ VAL [counter=100, counter++=99, x1=101, x2=5, y1=19, y2=4, y3=2] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=100] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=100, x1=101, x2=5, y1=19, y2=4, y3=2] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=100, x1=101, x2=5, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=101, counter++=100, x1=101, x2=5, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<100) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=101] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L18] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 13, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3199 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3195 mSDsluCounter, 2198 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 2085 mSDsCounter, 1238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2583 IncrementalHoareTripleChecker+Invalid, 3839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1238 mSolverCounterUnsat, 436 mSDtfsCounter, 2583 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5005 GetRequests, 4192 SyntacticMatches, 101 SemanticMatches, 712 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25586 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=12, InterpolantAutomatonStates: 607, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 2452 NumberOfCodeBlocks, 2452 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3160 ConstructedInterpolants, 0 QuantifiedInterpolants, 7996 SizeOfPredicates, 197 NumberOfNonLiveVariables, 3686 ConjunctsInSsa, 427 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 23531/92504 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME: 0.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 46, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 10, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 138, DAG_COMPRESSION_RETAINED_NODES: 50, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:20:23,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff150884-eebc-46bd-ab88-d9cf46cec628/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