./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:40:45,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:40:45,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:40:45,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:40:45,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:40:45,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:40:45,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:40:45,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:40:45,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:40:45,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:40:45,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:40:45,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:40:45,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:40:45,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:40:45,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:40:45,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:40:45,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:40:45,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:40:45,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:40:45,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:40:45,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:40:45,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:40:45,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:40:45,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:40:45,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:40:45,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:40:45,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:40:45,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:40:45,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:40:45,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:40:45,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:40:45,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:40:45,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:40:45,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:40:45,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:40:45,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:40:45,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:40:45,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:40:45,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:40:45,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:40:45,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:40:45,325 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:40:45,348 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:40:45,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:40:45,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:40:45,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:40:45,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:40:45,350 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:40:45,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:40:45,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:40:45,351 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:40:45,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:40:45,351 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:40:45,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:40:45,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:40:45,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:40:45,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:40:45,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:40:45,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:40:45,352 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:40:45,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:40:45,353 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:40:45,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:40:45,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:40:45,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:40:45,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:40:45,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:40:45,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:40:45,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:40:45,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:40:45,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:40:45,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:40:45,355 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:40:45,355 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:40:45,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:40:45,355 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:40:45,356 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_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/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_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa 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 -> Automizer 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 -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2021-12-07 01:40:45,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:40:45,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:40:45,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:40:45,547 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:40:45,548 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:40:45,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-12-07 01:40:45,590 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/data/e8234e663/3e6e03034353415ca0edc25ecc8dcd51/FLAGcda2dbcb1 [2021-12-07 01:40:45,961 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:40:45,961 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-12-07 01:40:45,966 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/data/e8234e663/3e6e03034353415ca0edc25ecc8dcd51/FLAGcda2dbcb1 [2021-12-07 01:40:45,978 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/data/e8234e663/3e6e03034353415ca0edc25ecc8dcd51 [2021-12-07 01:40:45,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:40:45,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:40:45,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:40:45,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:40:45,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:40:45,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:40:45" (1/1) ... [2021-12-07 01:40:45,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d214357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:45, skipping insertion in model container [2021-12-07 01:40:45,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:40:45" (1/1) ... [2021-12-07 01:40:45,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:40:46,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:40:46,126 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_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-12-07 01:40:46,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:40:46,143 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:40:46,152 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_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-12-07 01:40:46,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:40:46,167 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:40:46,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46 WrapperNode [2021-12-07 01:40:46,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:40:46,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:40:46,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:40:46,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:40:46,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,198 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-07 01:40:46,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:40:46,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:40:46,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:40:46,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:40:46,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:40:46,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:40:46,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:40:46,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:40:46,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (1/1) ... [2021-12-07 01:40:46,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:40:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:46,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:40:46,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:40:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:40:46,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:40:46,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:40:46,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:40:46,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-07 01:40:46,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-07 01:40:46,330 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:40:46,332 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:40:46,408 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:40:46,412 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:40:46,412 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-07 01:40:46,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:40:46 BoogieIcfgContainer [2021-12-07 01:40:46,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:40:46,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:40:46,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:40:46,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:40:46,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:40:45" (1/3) ... [2021-12-07 01:40:46,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df68eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:40:46, skipping insertion in model container [2021-12-07 01:40:46,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:46" (2/3) ... [2021-12-07 01:40:46,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df68eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:40:46, skipping insertion in model container [2021-12-07 01:40:46,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:40:46" (3/3) ... [2021-12-07 01:40:46,420 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2021-12-07 01:40:46,424 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:40:46,424 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:40:46,461 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:40:46,466 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:40:46,466 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:40:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-07 01:40:46,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:46,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:46,482 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2021-12-07 01:40:46,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871242662] [2021-12-07 01:40:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:46,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:46,563 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:46,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214466659] [2021-12-07 01:40:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:46,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:46,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:46,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:46,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:40:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:40:46,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:40:46,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:40:46,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:40:46,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:46,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871242662] [2021-12-07 01:40:46,752 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:46,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214466659] [2021-12-07 01:40:46,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214466659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:40:46,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:40:46,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:40:46,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124027307] [2021-12-07 01:40:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:40:46,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:40:46,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:40:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:40:46,781 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:40:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:40:46,865 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-12-07 01:40:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:40:46,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-07 01:40:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:40:46,872 INFO L225 Difference]: With dead ends: 54 [2021-12-07 01:40:46,873 INFO L226 Difference]: Without dead ends: 25 [2021-12-07 01:40:46,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:40:46,878 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:40:46,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:40:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-07 01:40:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-07 01:40:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-07 01:40:46,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2021-12-07 01:40:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:40:46,908 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-07 01:40:46,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:40:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-07 01:40:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-07 01:40:46,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:46,909 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:46,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:40:47,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-07 01:40:47,112 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2021-12-07 01:40:47,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:47,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658019549] [2021-12-07 01:40:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:47,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:47,158 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:47,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955552102] [2021-12-07 01:40:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:47,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:47,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:47,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:47,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:40:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:40:47,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 01:40:47,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:40:47,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:40:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:40:47,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658019549] [2021-12-07 01:40:47,651 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955552102] [2021-12-07 01:40:47,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955552102] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:40:47,651 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:40:47,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-12-07 01:40:47,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048422106] [2021-12-07 01:40:47,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:40:47,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:40:47,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:47,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:40:47,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:40:47,653 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:40:48,017 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-07 01:40:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 01:40:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-12-07 01:40:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:40:48,019 INFO L225 Difference]: With dead ends: 41 [2021-12-07 01:40:48,020 INFO L226 Difference]: Without dead ends: 34 [2021-12-07 01:40:48,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:40:48,021 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:40:48,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:40:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-07 01:40:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-07 01:40:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-07 01:40:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-07 01:40:48,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-12-07 01:40:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:40:48,028 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-07 01:40:48,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-07 01:40:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:40:48,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:48,029 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:48,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:40:48,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:48,232 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2021-12-07 01:40:48,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:48,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869435653] [2021-12-07 01:40:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:48,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:48,249 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:48,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631886334] [2021-12-07 01:40:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:48,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:48,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:48,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:48,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:40:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:40:48,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:40:48,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:40:48,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:40:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:40:48,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869435653] [2021-12-07 01:40:48,343 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631886334] [2021-12-07 01:40:48,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631886334] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:40:48,343 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:40:48,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-07 01:40:48,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702251343] [2021-12-07 01:40:48,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:40:48,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:40:48,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:40:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:40:48,346 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:40:48,392 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-07 01:40:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:40:48,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-12-07 01:40:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:40:48,393 INFO L225 Difference]: With dead ends: 73 [2021-12-07 01:40:48,393 INFO L226 Difference]: Without dead ends: 67 [2021-12-07 01:40:48,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:40:48,395 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:40:48,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:40:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-07 01:40:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-12-07 01:40:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-07 01:40:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-07 01:40:48,404 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2021-12-07 01:40:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:40:48,404 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-07 01:40:48,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-07 01:40:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:40:48,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:48,405 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:48,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:40:48,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:48,607 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2021-12-07 01:40:48,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:48,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280183959] [2021-12-07 01:40:48,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:48,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:48,638 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164089848] [2021-12-07 01:40:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:48,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:48,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:48,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:48,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:40:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:40:48,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-07 01:40:48,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:40:48,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:40:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:40:49,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280183959] [2021-12-07 01:40:49,210 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164089848] [2021-12-07 01:40:49,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164089848] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:40:49,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:40:49,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-12-07 01:40:49,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422231433] [2021-12-07 01:40:49,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:40:49,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-07 01:40:49,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-07 01:40:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:40:49,213 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-07 01:40:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:40:49,811 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-07 01:40:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-07 01:40:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2021-12-07 01:40:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:40:49,813 INFO L225 Difference]: With dead ends: 65 [2021-12-07 01:40:49,813 INFO L226 Difference]: Without dead ends: 57 [2021-12-07 01:40:49,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2021-12-07 01:40:49,814 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:40:49,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:40:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-07 01:40:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-12-07 01:40:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-07 01:40:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-07 01:40:49,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2021-12-07 01:40:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:40:49,822 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-07 01:40:49,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-07 01:40:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-07 01:40:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-07 01:40:49,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:49,824 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:49,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 01:40:50,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:50,024 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2021-12-07 01:40:50,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:50,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224066121] [2021-12-07 01:40:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:50,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:50,033 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:50,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202233836] [2021-12-07 01:40:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:50,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:50,034 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:50,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:40:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:40:50,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-07 01:40:50,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:40:50,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:40:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-07 01:40:50,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224066121] [2021-12-07 01:40:50,242 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202233836] [2021-12-07 01:40:50,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202233836] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:40:50,242 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:40:50,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-07 01:40:50,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904452607] [2021-12-07 01:40:50,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:40:50,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 01:40:50,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 01:40:50,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:40:50,244 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-07 01:40:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:40:50,369 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-12-07 01:40:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-07 01:40:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2021-12-07 01:40:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:40:50,371 INFO L225 Difference]: With dead ends: 116 [2021-12-07 01:40:50,371 INFO L226 Difference]: Without dead ends: 110 [2021-12-07 01:40:50,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-07 01:40:50,373 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:40:50,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 160 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:40:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-07 01:40:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-07 01:40:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-07 01:40:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-07 01:40:50,392 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2021-12-07 01:40:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:40:50,393 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-07 01:40:50,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-07 01:40:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-07 01:40:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-07 01:40:50,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:50,397 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:50,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:40:50,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:50,599 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2021-12-07 01:40:50,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:50,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151063989] [2021-12-07 01:40:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:50,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:50,651 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968546473] [2021-12-07 01:40:50,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:40:50,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:50,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:50,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:40:50,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:40:50,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:40:50,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-07 01:40:50,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:40:50,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:40:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-07 01:40:51,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:51,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151063989] [2021-12-07 01:40:51,209 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:51,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968546473] [2021-12-07 01:40:51,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968546473] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:40:51,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:40:51,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-07 01:40:51,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658007939] [2021-12-07 01:40:51,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:40:51,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-07 01:40:51,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:51,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-07 01:40:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-12-07 01:40:51,212 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-07 01:40:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:40:51,511 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2021-12-07 01:40:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-07 01:40:51,512 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2021-12-07 01:40:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:40:51,515 INFO L225 Difference]: With dead ends: 236 [2021-12-07 01:40:51,515 INFO L226 Difference]: Without dead ends: 230 [2021-12-07 01:40:51,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-12-07 01:40:51,517 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 257 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:40:51,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 286 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:40:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-07 01:40:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-12-07 01:40:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-07 01:40:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2021-12-07 01:40:51,544 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2021-12-07 01:40:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:40:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2021-12-07 01:40:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-07 01:40:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2021-12-07 01:40:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-07 01:40:51,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:40:51,550 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:40:51,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 01:40:51,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:51,754 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:40:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:40:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2021-12-07 01:40:51,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:40:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335255342] [2021-12-07 01:40:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:40:51,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:40:51,766 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:40:51,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889961718] [2021-12-07 01:40:51,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 01:40:51,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:40:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:40:51,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:40:51,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:40:51,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-07 01:40:51,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:40:51,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-07 01:40:51,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:40:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2021-12-07 01:40:52,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:40:52,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:40:52,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335255342] [2021-12-07 01:40:52,919 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:40:52,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889961718] [2021-12-07 01:40:52,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889961718] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:40:52,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:40:52,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-07 01:40:52,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773219541] [2021-12-07 01:40:52,919 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:40:52,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:40:52,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:40:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:40:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2021-12-07 01:40:52,920 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:40:54,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-07 01:40:58,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-07 01:41:00,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-07 01:41:02,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-07 01:41:05,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-07 01:41:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:41:07,527 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2021-12-07 01:41:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:41:07,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 229 [2021-12-07 01:41:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:41:07,530 INFO L225 Difference]: With dead ends: 449 [2021-12-07 01:41:07,530 INFO L226 Difference]: Without dead ends: 443 [2021-12-07 01:41:07,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=94, Invalid=409, Unknown=3, NotChecked=0, Total=506 [2021-12-07 01:41:07,532 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:41:07,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2021-12-07 01:41:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-12-07 01:41:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2021-12-07 01:41:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-07 01:41:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2021-12-07 01:41:07,559 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2021-12-07 01:41:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:41:07,560 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2021-12-07 01:41:07,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:41:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2021-12-07 01:41:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-07 01:41:07,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:41:07,564 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:41:07,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:41:07,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:07,766 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:41:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:41:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2021-12-07 01:41:07,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:41:07,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144687369] [2021-12-07 01:41:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:41:07,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:41:07,805 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:41:07,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704285912] [2021-12-07 01:41:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:41:07,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:41:07,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:41:07,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:41:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:41:07,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-07 01:41:07,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:41:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:41:08,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:41:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2021-12-07 01:41:08,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:41:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144687369] [2021-12-07 01:41:08,792 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:41:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704285912] [2021-12-07 01:41:08,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704285912] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:41:08,792 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:41:08,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-12-07 01:41:08,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149278441] [2021-12-07 01:41:08,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:41:08,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-07 01:41:08,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:41:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-07 01:41:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-12-07 01:41:08,795 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-12-07 01:41:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:41:09,769 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2021-12-07 01:41:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-07 01:41:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2021-12-07 01:41:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:41:09,776 INFO L225 Difference]: With dead ends: 929 [2021-12-07 01:41:09,776 INFO L226 Difference]: Without dead ends: 923 [2021-12-07 01:41:09,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-12-07 01:41:09,781 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 1008 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:41:09,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 526 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:41:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-12-07 01:41:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2021-12-07 01:41:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2021-12-07 01:41:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2021-12-07 01:41:09,843 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2021-12-07 01:41:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:41:09,843 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2021-12-07 01:41:09,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-12-07 01:41:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2021-12-07 01:41:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2021-12-07 01:41:09,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:41:09,852 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:41:09,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-07 01:41:10,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:10,053 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:41:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:41:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2021-12-07 01:41:10,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:41:10,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559705993] [2021-12-07 01:41:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:41:10,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:41:10,103 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:41:10,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288103599] [2021-12-07 01:41:10,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:41:10,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:10,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:41:10,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:41:10,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:41:10,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:41:10,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:41:10,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-07 01:41:10,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:41:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:41:11,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:41:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2021-12-07 01:41:12,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:41:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559705993] [2021-12-07 01:41:12,887 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:41:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288103599] [2021-12-07 01:41:12,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288103599] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:41:12,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:41:12,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-12-07 01:41:12,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902508501] [2021-12-07 01:41:12,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:41:12,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-12-07 01:41:12,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:41:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-12-07 01:41:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-12-07 01:41:12,893 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2021-12-07 01:41:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:41:16,299 INFO L93 Difference]: Finished difference Result 1889 states and 2123 transitions. [2021-12-07 01:41:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-12-07 01:41:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Word has length 469 [2021-12-07 01:41:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:41:16,307 INFO L225 Difference]: With dead ends: 1889 [2021-12-07 01:41:16,307 INFO L226 Difference]: Without dead ends: 1883 [2021-12-07 01:41:16,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-12-07 01:41:16,317 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 1464 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:41:16,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1464 Valid, 1030 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:41:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2021-12-07 01:41:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1880. [2021-12-07 01:41:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1504 states have (on average 1.125) internal successors, (1692), 1504 states have internal predecessors, (1692), 188 states have call successors, (188), 188 states have call predecessors, (188), 187 states have return successors, (187), 187 states have call predecessors, (187), 187 states have call successors, (187) [2021-12-07 01:41:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2067 transitions. [2021-12-07 01:41:16,405 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2067 transitions. Word has length 469 [2021-12-07 01:41:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:41:16,406 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2067 transitions. [2021-12-07 01:41:16,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 6.255102040816326) internal successors, (613), 98 states have internal predecessors, (613), 93 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2021-12-07 01:41:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2067 transitions. [2021-12-07 01:41:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2021-12-07 01:41:16,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:41:16,416 INFO L514 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 93, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:41:16,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 01:41:16,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:16,617 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:41:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:41:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 866618004, now seen corresponding path program 3 times [2021-12-07 01:41:16,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:41:16,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120024041] [2021-12-07 01:41:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:41:16,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:41:16,642 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:41:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876396358] [2021-12-07 01:41:16,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 01:41:16,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:16,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:41:16,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:41:16,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:41:18,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 95 check-sat command(s) [2021-12-07 01:41:18,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:41:18,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 2313 conjuncts, 191 conjunts are in the unsatisfiable core [2021-12-07 01:41:18,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:41:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:41:20,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:41:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 188 proven. 26414 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2021-12-07 01:41:21,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:41:21,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120024041] [2021-12-07 01:41:21,749 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-07 01:41:21,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876396358] [2021-12-07 01:41:21,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876396358] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:41:21,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:41:21,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-12-07 01:41:21,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112847455] [2021-12-07 01:41:21,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:41:21,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-12-07 01:41:21,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:41:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-12-07 01:41:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-12-07 01:41:21,754 INFO L87 Difference]: Start difference. First operand 1880 states and 2067 transitions. Second operand has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2021-12-07 01:41:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:41:25,169 INFO L93 Difference]: Finished difference Result 2009 states and 2213 transitions. [2021-12-07 01:41:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-12-07 01:41:25,170 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) Word has length 949 [2021-12-07 01:41:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:41:25,179 INFO L225 Difference]: With dead ends: 2009 [2021-12-07 01:41:25,179 INFO L226 Difference]: Without dead ends: 2003 [2021-12-07 01:41:25,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1793 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-12-07 01:41:25,182 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 1043 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:41:25,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 1108 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:41:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2021-12-07 01:41:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2000. [2021-12-07 01:41:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1600 states have (on average 1.125) internal successors, (1800), 1600 states have internal predecessors, (1800), 200 states have call successors, (200), 200 states have call predecessors, (200), 199 states have return successors, (199), 199 states have call predecessors, (199), 199 states have call successors, (199) [2021-12-07 01:41:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2199 transitions. [2021-12-07 01:41:25,283 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2199 transitions. Word has length 949 [2021-12-07 01:41:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:41:25,284 INFO L470 AbstractCegarLoop]: Abstraction has 2000 states and 2199 transitions. [2021-12-07 01:41:25,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.625) internal successors, (793), 104 states have internal predecessors, (793), 100 states have call successors, (189), 96 states have call predecessors, (189), 95 states have return successors, (188), 99 states have call predecessors, (188), 99 states have call successors, (188) [2021-12-07 01:41:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2199 transitions. [2021-12-07 01:41:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2021-12-07 01:41:25,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:41:25,296 INFO L514 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 99, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:41:25,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-07 01:41:25,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-07 01:41:25,496 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:41:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:41:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1685422910, now seen corresponding path program 4 times [2021-12-07 01:41:25,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:41:25,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775336237] [2021-12-07 01:41:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:41:25,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:41:25,521 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-07 01:41:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590588946] [2021-12-07 01:41:25,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-07 01:41:25,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:41:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:41:25,522 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:41:25,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:41:26,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-07 01:41:26,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-07 01:41:26,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:41:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:41:27,162 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:41:27,162 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:41:27,163 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:41:27,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-07 01:41:27,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-07 01:41:27,374 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2021-12-07 01:41:27,387 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:41:27,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:41:27 BoogieIcfgContainer [2021-12-07 01:41:27,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:41:27,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:41:27,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:41:27,599 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:41:27,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:40:46" (3/4) ... [2021-12-07 01:41:27,601 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 01:41:27,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:41:27,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:41:27,828 INFO L158 Benchmark]: Toolchain (without parser) took 41846.31ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 102.2MB in the beginning and 96.2MB in the end (delta: 6.0MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2021-12-07 01:41:27,829 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:41:27,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.22ms. Allocated memory is still 140.5MB. Free memory was 102.1MB in the beginning and 115.6MB in the end (delta: -13.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 01:41:27,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.43ms. Allocated memory is still 140.5MB. Free memory was 115.6MB in the beginning and 114.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:41:27,829 INFO L158 Benchmark]: Boogie Preprocessor took 16.95ms. Allocated memory is still 140.5MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:41:27,830 INFO L158 Benchmark]: RCFGBuilder took 197.01ms. Allocated memory is still 140.5MB. Free memory was 112.9MB in the beginning and 103.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 01:41:27,830 INFO L158 Benchmark]: TraceAbstraction took 41183.94ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 102.4MB in the beginning and 59.3MB in the end (delta: 43.1MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2021-12-07 01:41:27,830 INFO L158 Benchmark]: Witness Printer took 228.59ms. Allocated memory is still 205.5MB. Free memory was 59.3MB in the beginning and 96.2MB in the end (delta: -36.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2021-12-07 01:41:27,832 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.16ms. Allocated memory is still 140.5MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.22ms. Allocated memory is still 140.5MB. Free memory was 102.1MB in the beginning and 115.6MB in the end (delta: -13.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.43ms. Allocated memory is still 140.5MB. Free memory was 115.6MB in the beginning and 114.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.95ms. Allocated memory is still 140.5MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 197.01ms. Allocated memory is still 140.5MB. Free memory was 112.9MB in the beginning and 103.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41183.94ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 102.4MB in the beginning and 59.3MB in the end (delta: 43.1MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * Witness Printer took 228.59ms. Allocated memory is still 205.5MB. Free memory was 59.3MB in the beginning and 96.2MB in the end (delta: -36.9MB). Peak memory consumption was 33.0MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-393, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-393, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-393, x=0, x=0, x=0, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-393, x=0, x=0, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-393, x=0, x=0, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-389, x=0, x=0, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=1, v=-389, x=0, x=0, x=1, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-389, x=0, X=397, x=0, x=1, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-389, X=397, x=2, x=0, x=1, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-389, X=397, x=2, x=0, x=1, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-389, x=0, x=2, X=397, x=1, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-385, x=1, x=0, X=397, x=2, Y=2, y=0] [L45] x++ VAL [counter=2, v=-385, x=0, X=397, x=2, x=2, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-385, x=2, x=2, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-385, X=397, x=0, x=4, x=2, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-385, X=397, x=4, x=2, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-385, x=4, X=397, x=0, x=2, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-381, X=397, x=2, x=0, x=4, y=0, Y=2] [L45] x++ VAL [counter=3, v=-381, x=4, x=3, X=397, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-381, x=4, X=397, x=3, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-381, x=3, x=0, x=6, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-381, x=6, x=3, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-381, x=3, x=0, X=397, x=6, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-377, X=397, x=6, x=0, x=3, Y=2, y=0] [L45] x++ VAL [counter=4, v=-377, X=397, x=6, x=0, x=4, y=0, Y=2] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-377, x=0, x=4, X=397, x=6, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-377, X=397, x=8, x=4, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-377, x=0, x=4, X=397, x=8, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-377, x=8, x=4, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-373, x=0, x=8, X=397, x=4, y=0, Y=2] [L45] x++ VAL [counter=5, v=-373, x=5, x=0, x=8, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-373, x=0, X=397, x=5, x=8, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-373, x=10, x=0, x=5, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-373, x=0, x=10, x=5, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-373, x=0, x=5, X=397, x=10, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-369, x=0, x=10, X=397, x=5, Y=2, y=0] [L45] x++ VAL [counter=6, v=-369, x=0, x=10, x=6, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-369, x=0, X=397, x=6, x=10, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-369, x=12, x=0, x=6, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-369, X=397, x=6, x=0, x=12, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-369, x=6, X=397, x=12, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-365, x=12, x=0, X=397, x=6, y=0, Y=2] [L45] x++ VAL [counter=7, v=-365, x=0, x=7, X=397, x=12, y=0, Y=2] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-365, x=7, x=12, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-365, X=397, x=7, x=14, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-365, x=0, X=397, x=14, x=7, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-365, x=0, x=14, X=397, x=7, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-361, x=7, x=0, X=397, x=14, Y=2, y=0] [L45] x++ VAL [counter=8, v=-361, x=0, x=14, X=397, x=8, y=0, Y=2] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-361, x=8, x=14, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-361, X=397, x=8, x=16, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-361, x=16, x=0, x=8, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-361, x=8, X=397, x=16, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-357, x=16, x=8, x=0, X=397, Y=2, y=0] [L45] x++ VAL [counter=9, v=-357, x=16, X=397, x=9, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-357, x=0, x=16, X=397, x=9, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-357, x=18, x=9, X=397, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-357, x=0, X=397, x=9, x=18, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-357, x=0, X=397, x=9, x=18, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-353, x=0, x=9, x=18, X=397, y=0, Y=2] [L45] x++ VAL [counter=10, v=-353, x=18, x=0, X=397, x=10, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-353, x=10, x=0, x=18, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-353, x=10, X=397, x=20, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-353, x=0, x=10, X=397, x=20, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-353, X=397, x=10, x=20, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-349, x=10, x=20, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=11, v=-349, x=20, x=11, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-349, x=0, x=20, X=397, x=11, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-349, x=22, X=397, x=0, x=11, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-349, x=0, x=22, X=397, x=11, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-349, x=11, X=397, x=0, x=22, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-345, x=22, X=397, x=0, x=11, Y=2, y=0] [L45] x++ VAL [counter=12, v=-345, X=397, x=12, x=0, x=22, Y=2, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-345, x=22, X=397, x=12, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-345, X=397, x=12, x=0, x=24, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-345, X=397, x=24, x=12, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-345, x=12, x=0, X=397, x=24, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-341, x=24, X=397, x=12, x=0, Y=2, y=0] [L45] x++ VAL [counter=13, v=-341, x=0, x=24, X=397, x=13, y=0, Y=2] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-341, X=397, x=13, x=24, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-341, x=13, x=26, X=397, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-341, X=397, x=0, x=13, x=26, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-341, x=0, x=26, X=397, x=13, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-337, x=13, X=397, x=0, x=26, y=0, Y=2] [L45] x++ VAL [counter=14, v=-337, x=14, X=397, x=26, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-337, x=26, x=14, X=397, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-337, x=0, x=28, x=14, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-337, X=397, x=0, x=28, x=14, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-337, x=0, X=397, x=14, x=28, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-333, x=14, x=28, X=397, x=0, Y=2, y=0] [L45] x++ VAL [counter=15, v=-333, x=15, x=0, x=28, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-333, X=397, x=15, x=0, x=28, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-333, x=15, x=30, X=397, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-333, x=0, x=30, x=15, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-333, x=0, X=397, x=15, x=30, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-329, X=397, x=15, x=30, x=0, Y=2, y=0] [L45] x++ VAL [counter=16, v=-329, x=30, X=397, x=0, x=16, Y=2, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-329, X=397, x=30, x=0, x=16, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-329, x=32, X=397, x=0, x=16, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-329, x=32, x=16, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-329, x=0, x=32, X=397, x=16, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-325, x=0, x=16, X=397, x=32, Y=2, y=0] [L45] x++ VAL [counter=17, v=-325, x=0, X=397, x=17, x=32, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-325, x=32, x=0, X=397, x=17, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-325, X=397, x=17, x=34, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-325, x=17, X=397, x=0, x=34, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-325, x=17, x=0, X=397, x=34, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-321, x=17, X=397, x=0, x=34, Y=2, y=0] [L45] x++ VAL [counter=18, v=-321, x=18, x=0, x=34, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-321, x=18, x=0, X=397, x=34, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-321, x=0, X=397, x=36, x=18, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-321, X=397, x=0, x=18, x=36, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-321, X=397, x=36, x=0, x=18, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-317, X=397, x=36, x=18, x=0, y=0, Y=2] [L45] x++ VAL [counter=19, v=-317, X=397, x=36, x=19, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-317, x=0, x=36, X=397, x=19, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-317, X=397, x=38, x=0, x=19, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-317, X=397, x=38, x=0, x=19, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-317, X=397, x=38, x=19, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-313, X=397, x=0, x=38, x=19, Y=2, y=0] [L45] x++ VAL [counter=20, v=-313, X=397, x=38, x=20, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-313, X=397, x=0, x=20, x=38, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-313, x=20, x=40, x=0, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=-313, x=0, x=20, X=397, x=40, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-313, x=40, x=20, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-309, x=40, x=20, x=0, X=397, Y=2, y=0] [L45] x++ VAL [counter=21, v=-309, x=40, x=0, X=397, x=21, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-309, x=21, x=40, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-309, x=0, x=42, x=21, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-309, X=397, x=0, x=42, x=21, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-309, x=42, x=0, x=21, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-305, x=0, X=397, x=21, x=42, Y=2, y=0] [L45] x++ VAL [counter=22, v=-305, x=42, X=397, x=0, x=22, y=0, Y=2] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-305, x=42, x=22, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-305, X=397, x=44, x=0, x=22, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-305, x=0, x=22, X=397, x=44, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-305, x=0, x=22, x=44, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-301, x=22, x=44, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=23, v=-301, x=23, x=0, X=397, x=44, Y=2, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-301, x=0, X=397, x=23, x=44, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-301, x=0, X=397, x=23, x=46, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-301, X=397, x=0, x=23, x=46, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-301, x=46, x=0, X=397, x=23, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-297, X=397, x=0, x=23, x=46, y=0, Y=2] [L45] x++ VAL [counter=24, v=-297, x=0, x=46, X=397, x=24, y=0, Y=2] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-297, x=24, X=397, x=46, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-297, x=0, x=24, X=397, x=48, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=-297, X=397, x=48, x=24, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-297, x=48, x=24, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-293, x=24, x=0, x=48, X=397, Y=2, y=0] [L45] x++ VAL [counter=25, v=-293, x=48, x=25, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-293, x=48, X=397, x=25, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-293, x=50, x=0, x=25, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=-293, x=50, X=397, x=0, x=25, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-293, X=397, x=0, x=25, x=50, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-289, x=0, x=50, X=397, x=25, Y=2, y=0] [L45] x++ VAL [counter=26, v=-289, X=397, x=50, x=0, x=26, y=0, Y=2] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-289, x=50, x=26, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-289, X=397, x=0, x=52, x=26, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-289, x=52, X=397, x=0, x=26, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-289, x=0, X=397, x=52, x=26, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-285, x=0, x=26, X=397, x=52, y=0, Y=2] [L45] x++ VAL [counter=27, v=-285, X=397, x=27, x=0, x=52, y=0, Y=2] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-285, x=27, X=397, x=52, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-285, X=397, x=54, x=27, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=-285, x=54, X=397, x=0, x=27, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-285, x=54, x=27, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-281, x=54, x=0, X=397, x=27, y=0, Y=2] [L45] x++ VAL [counter=28, v=-281, X=397, x=28, x=54, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-281, x=0, X=397, x=54, x=28, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-281, x=28, x=56, x=0, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=-281, X=397, x=28, x=0, x=56, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-281, x=28, x=56, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-277, x=56, x=28, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=29, v=-277, X=397, x=0, x=29, x=56, y=0, Y=2] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-277, x=56, X=397, x=0, x=29, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-277, X=397, x=29, x=58, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=-277, x=0, x=58, X=397, x=29, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-277, X=397, x=0, x=29, x=58, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-273, x=29, x=58, x=0, X=397, Y=2, y=0] [L45] x++ VAL [counter=30, v=-273, x=30, x=58, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-273, x=0, x=58, X=397, x=30, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-273, X=397, x=0, x=30, x=60, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-273, x=0, x=60, X=397, x=30, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-273, x=60, x=30, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-269, X=397, x=30, x=60, x=0, y=0, Y=2] [L45] x++ VAL [counter=31, v=-269, x=31, x=0, x=60, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-269, x=0, x=60, X=397, x=31, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-269, x=31, x=62, X=397, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-269, x=62, x=31, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-269, x=31, X=397, x=62, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-265, x=31, X=397, x=0, x=62, y=0, Y=2] [L45] x++ VAL [counter=32, v=-265, X=397, x=32, x=62, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-265, x=0, X=397, x=62, x=32, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-265, x=0, x=64, X=397, x=32, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-265, x=0, x=32, x=64, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-265, X=397, x=32, x=64, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-261, x=32, x=64, x=0, X=397, Y=2, y=0] [L45] x++ VAL [counter=33, v=-261, x=33, x=0, X=397, x=64, y=0, Y=2] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-261, x=64, x=33, X=397, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-261, x=0, x=66, x=33, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-261, x=0, x=66, x=33, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-261, X=397, x=0, x=33, x=66, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-257, X=397, x=66, x=33, x=0, y=0, Y=2] [L45] x++ VAL [counter=34, v=-257, x=66, x=34, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-257, x=34, X=397, x=0, x=66, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-257, x=34, x=68, x=0, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=-257, X=397, x=68, x=0, x=34, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-257, x=0, X=397, x=34, x=68, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-253, x=0, X=397, x=68, x=34, y=0, Y=2] [L45] x++ VAL [counter=35, v=-253, x=68, x=35, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-253, x=68, x=35, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-253, x=70, x=0, x=35, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-253, X=397, x=70, x=35, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-253, X=397, x=35, x=0, x=70, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-249, x=70, X=397, x=0, x=35, y=0, Y=2] [L45] x++ VAL [counter=36, v=-249, x=70, x=36, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-249, x=0, x=36, x=70, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-249, x=36, x=72, x=0, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=-249, x=72, x=0, x=36, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-249, x=36, x=0, x=72, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-245, x=0, x=72, x=36, X=397, Y=2, y=0] [L45] x++ VAL [counter=37, v=-245, X=397, x=72, x=37, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-245, X=397, x=0, x=37, x=72, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-245, X=397, x=0, x=37, x=74, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-245, x=0, x=37, X=397, x=74, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-245, x=74, X=397, x=37, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-241, x=37, X=397, x=0, x=74, y=0, Y=2] [L45] x++ VAL [counter=38, v=-241, x=0, x=74, X=397, x=38, y=0, Y=2] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-241, X=397, x=0, x=74, x=38, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-241, X=397, x=76, x=38, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=-241, x=76, X=397, x=0, x=38, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-241, x=38, x=76, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-237, x=0, x=76, X=397, x=38, Y=2, y=0] [L45] x++ VAL [counter=39, v=-237, X=397, x=76, x=0, x=39, y=0, Y=2] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-237, x=76, x=0, X=397, x=39, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-237, x=0, x=78, X=397, x=39, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=-237, x=78, x=0, X=397, x=39, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-237, x=39, x=78, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-233, x=0, x=39, X=397, x=78, Y=2, y=0] [L45] x++ VAL [counter=40, v=-233, x=40, X=397, x=78, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-233, x=0, X=397, x=78, x=40, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-233, x=80, x=40, X=397, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-233, X=397, x=80, x=40, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-233, x=80, x=40, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-229, x=0, x=40, X=397, x=80, y=0, Y=2] [L45] x++ VAL [counter=41, v=-229, x=80, x=41, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-229, x=41, X=397, x=80, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-229, X=397, x=82, x=41, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-229, x=82, X=397, x=41, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-229, x=82, x=41, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-225, x=82, X=397, x=0, x=41, Y=2, y=0] [L45] x++ VAL [counter=42, v=-225, x=0, x=42, X=397, x=82, Y=2, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-225, x=42, x=0, X=397, x=82, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-225, X=397, x=0, x=84, x=42, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=-225, x=42, X=397, x=84, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-225, X=397, x=0, x=42, x=84, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-221, x=0, x=84, X=397, x=42, y=0, Y=2] [L45] x++ VAL [counter=43, v=-221, x=0, X=397, x=43, x=84, y=0, Y=2] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-221, x=43, x=0, X=397, x=84, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-221, x=86, x=0, X=397, x=43, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=-221, x=0, X=397, x=43, x=86, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-221, x=86, x=0, x=43, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-217, x=43, X=397, x=0, x=86, Y=2, y=0] [L45] x++ VAL [counter=44, v=-217, x=0, x=44, X=397, x=86, y=0, Y=2] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-217, x=86, x=0, X=397, x=44, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-217, X=397, x=88, x=0, x=44, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-217, x=88, x=44, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-217, x=88, x=0, X=397, x=44, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-213, x=88, x=0, x=44, X=397, Y=2, y=0] [L45] x++ VAL [counter=45, v=-213, x=88, X=397, x=45, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-213, x=88, x=0, x=45, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-213, x=90, X=397, x=45, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-213, x=45, X=397, x=0, x=90, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-213, x=90, x=45, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-209, x=0, x=90, X=397, x=45, y=0, Y=2] [L45] x++ VAL [counter=46, v=-209, x=46, X=397, x=0, x=90, Y=2, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-209, x=90, x=0, X=397, x=46, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-209, X=397, x=46, x=0, x=92, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=-209, x=92, x=46, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-209, x=46, x=0, X=397, x=92, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-205, X=397, x=0, x=92, x=46, Y=2, y=0] [L45] x++ VAL [counter=47, v=-205, x=92, X=397, x=47, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-205, x=47, x=0, x=92, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-205, x=0, x=94, X=397, x=47, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-205, X=397, x=47, x=94, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-205, x=47, x=94, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-201, x=0, x=47, X=397, x=94, y=0, Y=2] [L45] x++ VAL [counter=48, v=-201, x=48, X=397, x=94, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-201, x=94, X=397, x=0, x=48, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-201, x=96, X=397, x=48, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-201, x=96, x=48, x=0, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-201, x=48, x=96, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=-197, x=48, X=397, x=96, x=0, y=0, Y=2] [L45] x++ VAL [counter=49, v=-197, x=96, x=0, X=397, x=49, Y=2, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-197, X=397, x=0, x=49, x=96, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-197, x=98, x=49, x=0, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=-197, X=397, x=0, x=98, x=49, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=-197, x=49, x=0, x=98, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=50, v=-193, x=0, x=98, x=49, X=397, Y=2, y=0] [L45] x++ VAL [counter=50, v=-193, x=50, x=98, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-193, X=397, x=98, x=50, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=51, v=-193, x=50, x=0, X=397, x=100, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=51] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=51, v=-193, x=50, X=397, x=100, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=51, v=-193, x=50, X=397, x=0, x=100, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=51, v=-189, x=0, x=50, X=397, x=100, Y=2, y=0] [L45] x++ VAL [counter=51, v=-189, x=100, x=0, X=397, x=51, y=0, Y=2] [L31] EXPR counter++ VAL [counter=52, counter++=51, v=-189, X=397, x=100, x=51, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=52, v=-189, x=51, X=397, x=102, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=52] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=52, v=-189, x=102, x=0, x=51, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=52, v=-189, x=102, x=51, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=52, v=-185, x=51, x=0, x=102, X=397, Y=2, y=0] [L45] x++ VAL [counter=52, v=-185, x=102, x=0, x=52, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=53, counter++=52, v=-185, x=102, x=52, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=53, v=-185, x=104, X=397, x=52, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=53] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=53, v=-185, x=0, X=397, x=52, x=104, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=53, v=-185, x=104, X=397, x=0, x=52, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=53, v=-181, x=0, x=52, x=104, X=397, y=0, Y=2] [L45] x++ VAL [counter=53, v=-181, x=0, x=104, x=53, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=54, counter++=53, v=-181, x=104, x=0, x=53, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=54, v=-181, x=106, X=397, x=53, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=54] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=54, v=-181, x=106, x=53, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=54, v=-181, X=397, x=0, x=53, x=106, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=54, v=-177, x=106, x=53, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=54, v=-177, x=54, x=106, X=397, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=55, counter++=54, v=-177, X=397, x=0, x=54, x=106, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=55, v=-177, X=397, x=0, x=54, x=108, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=55] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=55, v=-177, x=54, x=0, X=397, x=108, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=55, v=-177, x=108, X=397, x=0, x=54, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=55, v=-173, x=54, x=108, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=55, v=-173, X=397, x=0, x=108, x=55, y=0, Y=2] [L31] EXPR counter++ VAL [counter=56, counter++=55, v=-173, x=55, x=108, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=56, v=-173, x=55, X=397, x=110, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=56] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=56, v=-173, x=110, X=397, x=55, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=56, v=-173, x=55, X=397, x=0, x=110, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=56, v=-169, x=110, x=55, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=56, v=-169, X=397, x=110, x=56, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=57, counter++=56, v=-169, x=56, x=0, x=110, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=57, v=-169, x=0, x=112, X=397, x=56, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=57] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=57, v=-169, x=112, x=56, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=57, v=-169, x=112, X=397, x=0, x=56, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=57, v=-165, x=56, X=397, x=112, x=0, Y=2, y=0] [L45] x++ VAL [counter=57, v=-165, X=397, x=57, x=0, x=112, y=0, Y=2] [L31] EXPR counter++ VAL [counter=58, counter++=57, v=-165, X=397, x=112, x=57, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=58, v=-165, x=114, X=397, x=57, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=58] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=58, v=-165, x=0, x=57, x=114, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=58, v=-165, x=57, x=114, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=58, v=-161, x=0, x=57, x=114, X=397, y=0, Y=2] [L45] x++ VAL [counter=58, v=-161, x=58, X=397, x=0, x=114, y=0, Y=2] [L31] EXPR counter++ VAL [counter=59, counter++=58, v=-161, X=397, x=114, x=0, x=58, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=59, v=-161, x=0, x=116, x=58, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=59] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=59, v=-161, x=58, x=0, x=116, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=59, v=-161, x=58, X=397, x=116, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=59, v=-157, x=58, X=397, x=0, x=116, y=0, Y=2] [L45] x++ VAL [counter=59, v=-157, X=397, x=116, x=59, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=60, counter++=59, v=-157, X=397, x=0, x=116, x=59, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=60, v=-157, x=59, X=397, x=118, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=60] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=60, v=-157, X=397, x=118, x=0, x=59, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=60, v=-157, x=59, x=118, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=60, v=-153, x=0, X=397, x=59, x=118, Y=2, y=0] [L45] x++ VAL [counter=60, v=-153, x=0, x=60, x=118, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=61, counter++=60, v=-153, x=118, x=60, x=0, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=61, v=-153, x=120, x=0, X=397, x=60, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=61] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=61, v=-153, x=60, X=397, x=0, x=120, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=61, v=-153, X=397, x=120, x=60, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=61, v=-149, X=397, x=0, x=120, x=60, Y=2, y=0] [L45] x++ VAL [counter=61, v=-149, x=0, x=61, X=397, x=120, Y=2, y=0] [L31] EXPR counter++ VAL [counter=62, counter++=61, v=-149, x=120, x=0, x=61, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=62, v=-149, X=397, x=0, x=122, x=61, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=62] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=62, v=-149, x=122, x=0, X=397, x=61, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=62, v=-149, x=0, x=61, x=122, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=62, v=-145, x=0, x=61, X=397, x=122, Y=2, y=0] [L45] x++ VAL [counter=62, v=-145, x=62, x=122, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=63, counter++=62, v=-145, x=122, X=397, x=0, x=62, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=63, v=-145, x=124, X=397, x=62, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=63] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=63, v=-145, X=397, x=62, x=124, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=63, v=-145, x=62, X=397, x=124, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=63, v=-141, x=124, x=0, X=397, x=62, y=0, Y=2] [L45] x++ VAL [counter=63, v=-141, X=397, x=63, x=0, x=124, y=0, Y=2] [L31] EXPR counter++ VAL [counter=64, counter++=63, v=-141, x=124, x=0, X=397, x=63, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=64, v=-141, X=397, x=0, x=63, x=126, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=64] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=64, v=-141, x=0, X=397, x=126, x=63, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=64, v=-141, x=63, x=126, X=397, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=64, v=-137, x=126, X=397, x=0, x=63, Y=2, y=0] [L45] x++ VAL [counter=64, v=-137, x=126, x=0, x=64, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=65, counter++=64, v=-137, x=64, X=397, x=126, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=65, v=-137, x=0, x=128, X=397, x=64, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=65] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=65, v=-137, x=128, x=64, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=65, v=-137, x=128, X=397, x=0, x=64, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=65, v=-133, x=128, X=397, x=0, x=64, Y=2, y=0] [L45] x++ VAL [counter=65, v=-133, x=65, x=0, X=397, x=128, y=0, Y=2] [L31] EXPR counter++ VAL [counter=66, counter++=65, v=-133, x=128, x=65, X=397, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=66, v=-133, X=397, x=65, x=0, x=130, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=66] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=66, v=-133, x=130, x=0, X=397, x=65, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=66, v=-133, x=0, X=397, x=65, x=130, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=66, v=-129, x=65, X=397, x=130, x=0, y=0, Y=2] [L45] x++ VAL [counter=66, v=-129, X=397, x=0, x=66, x=130, Y=2, y=0] [L31] EXPR counter++ VAL [counter=67, counter++=66, v=-129, x=0, X=397, x=130, x=66, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=67, v=-129, x=132, X=397, x=66, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=67] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=67, v=-129, X=397, x=66, x=132, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=67, v=-129, x=66, x=132, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=67, v=-125, x=0, x=132, X=397, x=66, Y=2, y=0] [L45] x++ VAL [counter=67, v=-125, x=67, x=0, X=397, x=132, y=0, Y=2] [L31] EXPR counter++ VAL [counter=68, counter++=67, v=-125, X=397, x=132, x=67, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=68, v=-125, X=397, x=134, x=67, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=68] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=68, v=-125, X=397, x=67, x=0, x=134, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=68, v=-125, x=0, X=397, x=67, x=134, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=68, v=-121, x=0, x=67, X=397, x=134, Y=2, y=0] [L45] x++ VAL [counter=68, v=-121, x=0, x=68, x=134, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=69, counter++=68, v=-121, X=397, x=68, x=134, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=69, v=-121, x=68, X=397, x=0, x=136, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=69] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=69, v=-121, X=397, x=0, x=136, x=68, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=69, v=-121, x=136, x=0, x=68, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=69, v=-117, x=136, x=68, X=397, x=0, Y=2, y=0] [L45] x++ VAL [counter=69, v=-117, x=136, x=69, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=70, counter++=69, v=-117, x=0, X=397, x=136, x=69, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=70, v=-117, x=0, x=69, x=138, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=70] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=70, v=-117, X=397, x=138, x=0, x=69, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=70, v=-117, X=397, x=69, x=0, x=138, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=70, v=-113, x=138, x=69, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=70, v=-113, X=397, x=0, x=70, x=138, Y=2, y=0] [L31] EXPR counter++ VAL [counter=71, counter++=70, v=-113, x=138, X=397, x=70, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=71, v=-113, x=70, X=397, x=140, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=71] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=71, v=-113, X=397, x=0, x=70, x=140, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=71, v=-113, X=397, x=0, x=70, x=140, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=71, v=-109, X=397, x=0, x=140, x=70, Y=2, y=0] [L45] x++ VAL [counter=71, v=-109, x=71, X=397, x=140, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=72, counter++=71, v=-109, x=140, X=397, x=0, x=71, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=72, v=-109, x=142, X=397, x=0, x=71, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=72] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=72, v=-109, x=142, x=0, x=71, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=72, v=-109, x=71, X=397, x=0, x=142, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=72, v=-105, x=142, X=397, x=0, x=71, Y=2, y=0] [L45] x++ VAL [counter=72, v=-105, X=397, x=142, x=0, x=72, y=0, Y=2] [L31] EXPR counter++ VAL [counter=73, counter++=72, v=-105, x=0, x=142, X=397, x=72, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=73, v=-105, x=72, x=0, x=144, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=73] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=73, v=-105, X=397, x=72, x=144, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=73, v=-105, x=72, x=144, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=73, v=-101, x=144, x=72, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=73, v=-101, x=73, x=0, x=144, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=74, counter++=73, v=-101, x=73, x=0, X=397, x=144, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=74, v=-101, x=0, x=73, X=397, x=146, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=74] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=74, v=-101, x=0, X=397, x=73, x=146, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=74, v=-101, x=73, X=397, x=146, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=74, v=-97, x=73, x=146, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=74, v=-97, X=397, x=74, x=146, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=75, counter++=74, v=-97, x=74, X=397, x=0, x=146, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=75, v=-97, x=148, X=397, x=74, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=75] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=75, v=-97, x=74, X=397, x=0, x=148, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=75, v=-97, x=74, X=397, x=148, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=75, v=-93, x=74, x=0, X=397, x=148, y=0, Y=2] [L45] x++ VAL [counter=75, v=-93, x=148, x=75, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=76, counter++=75, v=-93, x=0, x=148, x=75, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=76, v=-93, x=75, x=0, x=150, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=76] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=76, v=-93, x=75, X=397, x=150, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=76, v=-93, X=397, x=150, x=0, x=75, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=76, v=-89, x=0, x=75, X=397, x=150, y=0, Y=2] [L45] x++ VAL [counter=76, v=-89, X=397, x=0, x=150, x=76, Y=2, y=0] [L31] EXPR counter++ VAL [counter=77, counter++=76, v=-89, X=397, x=150, x=76, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=77, v=-89, x=76, x=0, X=397, x=152, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=77] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=77, v=-89, x=0, x=76, x=152, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=77, v=-89, x=76, x=0, x=152, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=77, v=-85, x=0, x=152, X=397, x=76, y=0, Y=2] [L45] x++ VAL [counter=77, v=-85, x=152, X=397, x=77, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=78, counter++=77, v=-85, x=152, x=0, X=397, x=77, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=78, v=-85, x=154, x=0, x=77, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=78] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=78, v=-85, X=397, x=0, x=154, x=77, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=78, v=-85, x=154, x=77, X=397, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=78, v=-81, x=154, X=397, x=0, x=77, Y=2, y=0] [L45] x++ VAL [counter=78, v=-81, X=397, x=154, x=78, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=79, counter++=78, v=-81, X=397, x=78, x=154, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=79, v=-81, x=0, x=78, X=397, x=156, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=79] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=79, v=-81, X=397, x=0, x=78, x=156, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=79, v=-81, x=0, x=156, X=397, x=78, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=79, v=-77, x=0, x=78, x=156, X=397, y=0, Y=2] [L45] x++ VAL [counter=79, v=-77, x=79, X=397, x=156, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=80, counter++=79, v=-77, X=397, x=0, x=156, x=79, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=80, v=-77, x=79, x=0, X=397, x=158, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=80] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=80, v=-77, x=0, X=397, x=79, x=158, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=80, v=-77, X=397, x=79, x=158, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=80, v=-73, x=158, X=397, x=0, x=79, Y=2, y=0] [L45] x++ VAL [counter=80, v=-73, X=397, x=158, x=80, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=81, counter++=80, v=-73, X=397, x=0, x=158, x=80, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=81, v=-73, x=160, x=80, X=397, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=81] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=81, v=-73, x=80, X=397, x=0, x=160, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=81, v=-73, x=160, x=0, x=80, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=81, v=-69, x=160, x=0, X=397, x=80, y=0, Y=2] [L45] x++ VAL [counter=81, v=-69, x=160, x=81, x=0, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=82, counter++=81, v=-69, x=160, x=81, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=82, v=-69, x=162, x=81, X=397, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=82] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=82, v=-69, X=397, x=162, x=81, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=82, v=-69, X=397, x=81, x=162, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=82, v=-65, x=0, x=162, x=81, X=397, Y=2, y=0] [L45] x++ VAL [counter=82, v=-65, x=82, X=397, x=162, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=83, counter++=82, v=-65, x=162, x=82, X=397, x=0, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=83, v=-65, x=82, x=164, x=0, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=83] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=83, v=-65, x=82, x=164, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=83, v=-65, x=0, x=164, x=82, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=83, v=-61, x=164, x=82, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=83, v=-61, x=83, x=164, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=84, counter++=83, v=-61, X=397, x=0, x=83, x=164, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=84, v=-61, X=397, x=0, x=166, x=83, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=84] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=84, v=-61, x=0, x=166, X=397, x=83, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=84, v=-61, x=83, x=0, x=166, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=84, v=-57, x=166, x=0, X=397, x=83, Y=2, y=0] [L45] x++ VAL [counter=84, v=-57, x=84, x=166, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=85, counter++=84, v=-57, X=397, x=0, x=166, x=84, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=85, v=-57, x=168, x=84, x=0, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=85] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=85, v=-57, x=0, X=397, x=84, x=168, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=85, v=-57, X=397, x=0, x=168, x=84, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=85, v=-53, x=0, x=84, X=397, x=168, y=0, Y=2] [L45] x++ VAL [counter=85, v=-53, x=168, x=0, x=85, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=86, counter++=85, v=-53, x=85, X=397, x=0, x=168, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=86, v=-53, x=85, x=170, X=397, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=86] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=86, v=-53, x=170, X=397, x=0, x=85, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=86, v=-53, x=170, x=0, X=397, x=85, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=86, v=-49, x=85, x=170, X=397, x=0, Y=2, y=0] [L45] x++ VAL [counter=86, v=-49, X=397, x=170, x=86, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=87, counter++=86, v=-49, x=170, X=397, x=0, x=86, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=87, v=-49, x=0, x=172, x=86, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=87] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=87, v=-49, x=0, X=397, x=172, x=86, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=87, v=-49, x=172, x=86, x=0, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=87, v=-45, x=172, x=86, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=87, v=-45, X=397, x=87, x=172, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=88, counter++=87, v=-45, x=87, X=397, x=172, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=88, v=-45, x=0, X=397, x=174, x=87, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=88] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=88, v=-45, x=174, x=0, X=397, x=87, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=88, v=-45, x=87, x=0, X=397, x=174, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=88, v=-41, x=174, x=87, X=397, x=0, y=0, Y=2] [L45] x++ VAL [counter=88, v=-41, x=88, x=0, X=397, x=174, y=0, Y=2] [L31] EXPR counter++ VAL [counter=89, counter++=88, v=-41, X=397, x=0, x=88, x=174, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=89, v=-41, X=397, x=0, x=88, x=176, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=89] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=89, v=-41, x=176, x=88, X=397, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=89, v=-41, X=397, x=0, x=88, x=176, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=89, v=-37, x=0, X=397, x=176, x=88, Y=2, y=0] [L45] x++ VAL [counter=89, v=-37, x=89, x=176, X=397, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=90, counter++=89, v=-37, x=89, x=176, X=397, x=0, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=90, v=-37, x=0, X=397, x=178, x=89, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=90] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=90, v=-37, X=397, x=89, x=178, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=90, v=-37, x=0, x=178, x=89, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=90, v=-33, X=397, x=178, x=89, x=0, y=0, Y=2] [L45] x++ VAL [counter=90, v=-33, x=90, X=397, x=0, x=178, Y=2, y=0] [L31] EXPR counter++ VAL [counter=91, counter++=90, v=-33, x=0, x=178, x=90, X=397, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=91, v=-33, x=180, x=0, X=397, x=90, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=91] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=91, v=-33, x=90, X=397, x=180, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=91, v=-33, x=180, X=397, x=0, x=90, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=91, v=-29, x=0, x=90, X=397, x=180, Y=2, y=0] [L45] x++ VAL [counter=91, v=-29, x=180, x=91, x=0, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=92, counter++=91, v=-29, x=91, x=0, X=397, x=180, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=92, v=-29, x=91, x=182, x=0, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=92] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=92, v=-29, x=91, X=397, x=0, x=182, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=92, v=-29, X=397, x=0, x=91, x=182, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=92, v=-25, x=182, x=0, x=91, X=397, y=0, Y=2] [L45] x++ VAL [counter=92, v=-25, x=92, x=182, X=397, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=93, counter++=92, v=-25, X=397, x=0, x=182, x=92, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=93, v=-25, x=184, x=0, X=397, x=92, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=93] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=93, v=-25, x=184, x=0, X=397, x=92, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=93, v=-25, x=184, X=397, x=92, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=93, v=-21, x=0, X=397, x=92, x=184, y=0, Y=2] [L45] x++ VAL [counter=93, v=-21, x=0, x=184, X=397, x=93, Y=2, y=0] [L31] EXPR counter++ VAL [counter=94, counter++=93, v=-21, X=397, x=93, x=0, x=184, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=94, v=-21, x=186, X=397, x=0, x=93, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=94] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=94, v=-21, X=397, x=93, x=186, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=94, v=-21, x=0, x=93, x=186, X=397, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=94, v=-17, x=93, X=397, x=0, x=186, y=0, Y=2] [L45] x++ VAL [counter=94, v=-17, x=94, x=0, X=397, x=186, Y=2, y=0] [L31] EXPR counter++ VAL [counter=95, counter++=94, v=-17, x=186, X=397, x=0, x=94, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=95, v=-17, x=94, x=0, X=397, x=188, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=95] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=95, v=-17, x=188, x=94, x=0, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=95, v=-17, x=94, x=188, x=0, X=397, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=95, v=-13, x=0, X=397, x=94, x=188, y=0, Y=2] [L45] x++ VAL [counter=95, v=-13, x=95, x=0, x=188, X=397, Y=2, y=0] [L31] EXPR counter++ VAL [counter=96, counter++=95, v=-13, x=95, x=188, x=0, X=397, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=96, v=-13, X=397, x=0, x=95, x=190, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=96] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=96, v=-13, x=95, x=190, x=0, X=397, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=96, v=-13, x=0, x=95, X=397, x=190, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=96, v=-9, x=0, x=190, X=397, x=95, Y=2, y=0] [L45] x++ VAL [counter=96, v=-9, x=96, x=0, X=397, x=190, Y=2, y=0] [L31] EXPR counter++ VAL [counter=97, counter++=96, v=-9, X=397, x=190, x=0, x=96, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=97, v=-9, x=192, x=0, X=397, x=96, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=97] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=97, v=-9, x=96, X=397, x=0, x=192, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=97, v=-9, x=192, x=0, X=397, x=96, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=97, v=-5, X=397, x=192, x=0, x=96, y=0, Y=2] [L45] x++ VAL [counter=97, v=-5, x=0, x=192, x=97, X=397, y=0, Y=2] [L31] EXPR counter++ VAL [counter=98, counter++=97, v=-5, x=0, X=397, x=192, x=97, Y=2, y=0] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=98, v=-5, x=194, x=0, x=97, X=397, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=98] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=98, v=-5, x=194, X=397, x=0, x=97, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=98, v=-5, x=97, X=397, x=0, x=194, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=98, v=-1, x=194, X=397, x=97, x=0, y=0, Y=2] [L45] x++ VAL [counter=98, v=-1, X=397, x=98, x=194, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=99, counter++=98, v=-1, X=397, x=194, x=0, x=98, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=99, v=-1, x=196, x=0, x=98, X=397, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=99] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=99, v=-1, x=0, x=98, X=397, x=196, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=99, v=-1, X=397, x=98, x=196, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=99, v=3, x=98, x=196, x=0, X=397, y=0, Y=2] [L45] x++ VAL [counter=99, v=3, x=196, x=0, X=397, x=99, y=0, Y=2] [L31] EXPR counter++ VAL [counter=100, counter++=99, v=3, x=196, X=397, x=0, x=99, y=0, Y=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=100, v=3, X=397, x=99, x=0, x=198, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=100] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=100, v=3, x=0, x=99, x=198, X=397, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=100, v=3, X=397, x=198, x=99, x=0, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100, v=-787, x=198, x=99, x=0, X=397, Y=2, y=1] [L45] x++ VAL [counter=100, v=-787, x=198, X=397, x=100, x=0, y=1, Y=2] [L31] EXPR counter++ VAL [counter=101, counter++=100, v=-787, X=397, x=198, x=100, x=0, y=1, Y=2] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=101, v=-787, x=200, X=397, x=100, x=100, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=101] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.9s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 4025 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4024 mSDsluCounter, 3549 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3138 mSDsCounter, 1031 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2559 IncrementalHoareTripleChecker+Invalid, 3595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1031 mSolverCounterUnsat, 411 mSDtfsCounter, 2559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4272 GetRequests, 3633 SyntacticMatches, 4 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12544 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2000occurred in iteration=10, InterpolantAutomatonStates: 619, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 3953 ConstructedInterpolants, 0 QuantifiedInterpolants, 10839 SizeOfPredicates, 197 NumberOfNonLiveVariables, 4894 ConjunctsInSsa, 452 ConjunctsInUnsatCore, 18 InterpolantComputations, 1 PerfectInterpolantSequences, 25881/117608 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-07 01:41:27,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8b7e69-0d82-4382-83dd-5cd036eb6b7e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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