./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN --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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:09:01,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:09:01,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:09:01,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:09:01,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:09:01,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:09:01,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:09:01,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:09:01,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:09:01,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:09:01,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:09:01,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:09:01,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:09:01,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:09:01,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:09:01,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:09:01,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:09:01,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:09:01,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:09:01,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:09:01,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:09:01,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:09:01,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:09:01,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:09:01,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:09:01,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:09:01,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:09:01,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:09:01,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:09:01,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:09:01,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:09:01,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:09:01,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:09:01,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:09:01,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:09:01,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:09:01,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:09:01,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:09:01,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:09:01,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:09:01,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:09:01,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:09:01,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:09:01,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:09:01,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:09:01,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:09:01,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:09:01,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:09:01,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:09:01,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:09:01,540 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:09:01,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:09:01,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:09:01,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:09:01,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:09:01,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:09:01,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:09:01,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:09:01,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:09:01,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:09:01,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:09:01,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:09:01,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:09:01,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:09:01,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:09:01,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:09:01,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:09:01,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:09:01,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:09:01,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:09:01,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:09:01,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:09:01,546 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:09:01,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:09:01,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:09:01,547 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_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/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_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2022-11-20 12:09:01,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:09:01,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:09:01,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:09:01,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:09:01,828 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:09:01,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-20 12:09:04,843 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:09:05,065 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:09:05,066 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-20 12:09:05,072 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/data/3ba27af9c/41ee828d591e4435adc42c8ab2392db9/FLAG95102ed76 [2022-11-20 12:09:05,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/data/3ba27af9c/41ee828d591e4435adc42c8ab2392db9 [2022-11-20 12:09:05,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:09:05,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:09:05,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:09:05,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:09:05,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:09:05,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c462365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05, skipping insertion in model container [2022-11-20 12:09:05,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:09:05,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:09:05,266 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-20 12:09:05,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:09:05,295 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:09:05,307 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-20 12:09:05,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:09:05,329 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:09:05,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05 WrapperNode [2022-11-20 12:09:05,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:09:05,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:09:05,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:09:05,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:09:05,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,362 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-20 12:09:05,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:09:05,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:09:05,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:09:05,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:09:05,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,380 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:09:05,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:09:05,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:09:05,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:09:05,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (1/1) ... [2022-11-20 12:09:05,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:09:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:05,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:09:05,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:09:05,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:09:05,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:09:05,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:09:05,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:09:05,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 12:09:05,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 12:09:05,550 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:09:05,553 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:09:05,731 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:09:05,737 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:09:05,737 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:09:05,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:05 BoogieIcfgContainer [2022-11-20 12:09:05,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:09:05,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:09:05,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:09:05,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:09:05,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:09:05" (1/3) ... [2022-11-20 12:09:05,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d4404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:05, skipping insertion in model container [2022-11-20 12:09:05,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:05" (2/3) ... [2022-11-20 12:09:05,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d4404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:05, skipping insertion in model container [2022-11-20 12:09:05,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:05" (3/3) ... [2022-11-20 12:09:05,750 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-11-20 12:09:05,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:09:05,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:09:05,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:09:05,844 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1adb1779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:09:05,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:09:05,851 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) [2022-11-20 12:09:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 12:09:05,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:05,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:05,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:05,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-11-20 12:09:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:05,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297184738] [2022-11-20 12:09:05,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:06,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264537425] [2022-11-20 12:09:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:06,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:06,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:06,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:06,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:09:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:06,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:09:06,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:06,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:09:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297184738] [2022-11-20 12:09:06,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264537425] [2022-11-20 12:09:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264537425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:06,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:09:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957487955] [2022-11-20 12:09:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:06,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:09:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:09:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:09:06,444 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) [2022-11-20 12:09:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:06,581 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-11-20 12:09:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:09:06,584 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 [2022-11-20 12:09:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:06,592 INFO L225 Difference]: With dead ends: 54 [2022-11-20 12:09:06,592 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 12:09:06,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:09:06,615 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:06,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:09:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 12:09:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-20 12:09:06,715 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) [2022-11-20 12:09:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-20 12:09:06,717 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-11-20 12:09:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:06,718 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-20 12:09:06,718 INFO L496 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) [2022-11-20 12:09:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-20 12:09:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:09:06,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:06,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:06,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:06,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-20 12:09:06,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:06,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:06,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-11-20 12:09:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:06,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328610408] [2022-11-20 12:09:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:06,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47095154] [2022-11-20 12:09:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:06,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:06,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:06,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:06,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:09:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:07,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 12:09:07,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:07,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328610408] [2022-11-20 12:09:07,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47095154] [2022-11-20 12:09:07,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47095154] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:07,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:07,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-11-20 12:09:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598541199] [2022-11-20 12:09:07,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:07,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 12:09:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:07,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 12:09:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:09:07,735 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:09:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:08,319 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-11-20 12:09:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:09:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 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 [2022-11-20 12:09:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:08,321 INFO L225 Difference]: With dead ends: 41 [2022-11-20 12:09:08,321 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 12:09:08,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:09:08,323 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:08,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 64 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:09:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 12:09:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-20 12:09:08,335 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) [2022-11-20 12:09:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-20 12:09:08,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-11-20 12:09:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:08,339 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-20 12:09:08,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:09:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-20 12:09:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 12:09:08,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:08,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:08,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:08,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:08,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-11-20 12:09:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:08,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40537730] [2022-11-20 12:09:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:08,575 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:08,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457899533] [2022-11-20 12:09:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:08,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:08,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:09:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:08,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:09:08,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:08,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:08,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40537730] [2022-11-20 12:09:08,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457899533] [2022-11-20 12:09:08,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457899533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:08,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:08,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-20 12:09:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224517597] [2022-11-20 12:09:08,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:08,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:09:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:08,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:09:08,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:09:08,730 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) [2022-11-20 12:09:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:08,817 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-20 12:09:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:09:08,818 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 [2022-11-20 12:09:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:08,819 INFO L225 Difference]: With dead ends: 73 [2022-11-20 12:09:08,819 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 12:09:08,820 INFO L412 NwaCegarLoop]: 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 [2022-11-20 12:09:08,821 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:08,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:09:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 12:09:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-20 12:09:08,835 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) [2022-11-20 12:09:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-11-20 12:09:08,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-11-20 12:09:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:08,837 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-11-20 12:09:08,837 INFO L496 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) [2022-11-20 12:09:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-11-20 12:09:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 12:09:08,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:08,838 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:08,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:09,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:09,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-11-20 12:09:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:09,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702712925] [2022-11-20 12:09:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:09,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:09,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83882327] [2022-11-20 12:09:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:09,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:09,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:09:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:09,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 12:09:09,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:09:09,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:09:09,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:09,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702712925] [2022-11-20 12:09:09,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:09,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83882327] [2022-11-20 12:09:09,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83882327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:09,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:09,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2022-11-20 12:09:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245580436] [2022-11-20 12:09:09,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:09,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 12:09:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:09,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:09:09,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:09:09,954 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:09:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:11,076 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-20 12:09:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 12:09:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 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 [2022-11-20 12:09:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:11,080 INFO L225 Difference]: With dead ends: 65 [2022-11-20 12:09:11,082 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 12:09:11,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 12:09:11,087 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:11,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 78 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:09:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 12:09:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-11-20 12:09:11,121 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) [2022-11-20 12:09:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-11-20 12:09:11,126 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2022-11-20 12:09:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:11,131 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-11-20 12:09:11,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:09:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-11-20 12:09:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 12:09:11,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:11,133 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:11,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:11,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:11,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-11-20 12:09:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845925169] [2022-11-20 12:09:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:11,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:11,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594292888] [2022-11-20 12:09:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:11,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:11,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:11,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:11,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:09:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:11,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:09:11,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:11,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 12:09:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:11,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845925169] [2022-11-20 12:09:11,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:11,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594292888] [2022-11-20 12:09:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594292888] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:11,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:11,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-20 12:09:11,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679730804] [2022-11-20 12:09:11,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:11,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:09:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:09:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:09:11,673 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) [2022-11-20 12:09:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:11,895 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-11-20 12:09:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:09:11,896 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 [2022-11-20 12:09:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:11,898 INFO L225 Difference]: With dead ends: 116 [2022-11-20 12:09:11,898 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 12:09:11,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:09:11,900 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:11,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 166 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:09:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 12:09:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-20 12:09:11,928 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) [2022-11-20 12:09:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-11-20 12:09:11,930 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-11-20 12:09:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:11,930 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-11-20 12:09:11,930 INFO L496 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) [2022-11-20 12:09:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-11-20 12:09:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-20 12:09:11,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:11,933 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:11,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:12,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:12,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-11-20 12:09:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:12,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130143118] [2022-11-20 12:09:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:12,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:12,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797999236] [2022-11-20 12:09:12,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:09:12,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:12,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:12,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:09:12,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:09:12,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:09:12,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 12:09:12,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:12,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-20 12:09:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:12,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130143118] [2022-11-20 12:09:12,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:12,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797999236] [2022-11-20 12:09:12,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797999236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:12,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:12,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-20 12:09:12,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879005237] [2022-11-20 12:09:12,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:12,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 12:09:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:12,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 12:09:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-20 12:09:12,948 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) [2022-11-20 12:09:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:13,587 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-11-20 12:09:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 12:09:13,588 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 [2022-11-20 12:09:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:13,593 INFO L225 Difference]: With dead ends: 236 [2022-11-20 12:09:13,593 INFO L226 Difference]: Without dead ends: 230 [2022-11-20 12:09:13,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-20 12:09:13,596 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 229 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:13,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 286 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:09:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-20 12:09:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-20 12:09:13,657 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) [2022-11-20 12:09:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-11-20 12:09:13,660 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-11-20 12:09:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:13,660 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-11-20 12:09:13,660 INFO L496 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) [2022-11-20 12:09:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-11-20 12:09:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-20 12:09:13,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:13,663 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:13,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:13,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:13,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-11-20 12:09:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493075275] [2022-11-20 12:09:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:13,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691167663] [2022-11-20 12:09:13,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:09:13,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:13,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:13,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:13,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:09:14,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:09:14,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:09:14,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 12:09:14,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-11-20 12:09:14,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-11-20 12:09:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:15,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493075275] [2022-11-20 12:09:15,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:15,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691167663] [2022-11-20 12:09:15,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691167663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:15,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:15,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-11-20 12:09:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175678117] [2022-11-20 12:09:15,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:15,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:09:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:15,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:09:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:09:15,215 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:09:17,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-20 12:09:21,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-20 12:09:23,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-20 12:09:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:27,819 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-11-20 12:09:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:09:27,820 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2022-11-20 12:09:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:27,823 INFO L225 Difference]: With dead ends: 449 [2022-11-20 12:09:27,824 INFO L226 Difference]: Without dead ends: 443 [2022-11-20 12:09:27,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=89, Invalid=415, Unknown=2, NotChecked=0, Total=506 [2022-11-20 12:09:27,825 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:27,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-11-20 12:09:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-20 12:09:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-11-20 12:09:27,913 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) [2022-11-20 12:09:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-11-20 12:09:27,916 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-11-20 12:09:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:27,917 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-11-20 12:09:27,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:09:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-11-20 12:09:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-20 12:09:27,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:27,922 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:27,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:28,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:09:28,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-11-20 12:09:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:28,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806062095] [2022-11-20 12:09:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:28,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:28,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465764191] [2022-11-20 12:09:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:28,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:28,154 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:28,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:09:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:28,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 12:09:28,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:29,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-11-20 12:09:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806062095] [2022-11-20 12:09:30,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465764191] [2022-11-20 12:09:30,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465764191] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:30,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:30,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-20 12:09:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304368312] [2022-11-20 12:09:30,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:30,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 12:09:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 12:09:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-20 12:09:30,231 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) [2022-11-20 12:09:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:32,269 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-11-20 12:09:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-20 12:09:32,270 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 [2022-11-20 12:09:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:32,284 INFO L225 Difference]: With dead ends: 929 [2022-11-20 12:09:32,284 INFO L226 Difference]: Without dead ends: 923 [2022-11-20 12:09:32,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-20 12:09:32,290 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 645 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:32,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 485 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:09:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-20 12:09:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-11-20 12:09:32,465 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) [2022-11-20 12:09:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-11-20 12:09:32,469 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-11-20 12:09:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:32,470 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-11-20 12:09:32,470 INFO L496 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) [2022-11-20 12:09:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-11-20 12:09:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-11-20 12:09:32,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:32,481 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:32,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:32,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:32,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-11-20 12:09:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:32,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709577478] [2022-11-20 12:09:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:32,738 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:32,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552090962] [2022-11-20 12:09:32,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:09:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:32,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:32,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:09:33,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:09:33,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:09:33,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-20 12:09:33,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:09:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:09:35,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:09:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-11-20 12:09:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709577478] [2022-11-20 12:09:36,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:09:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552090962] [2022-11-20 12:09:36,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552090962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:09:36,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:09:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-20 12:09:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363088493] [2022-11-20 12:09:36,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:09:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-20 12:09:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:36,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-20 12:09:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-20 12:09:36,826 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-11-20 12:09:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:38,847 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2022-11-20 12:09:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-20 12:09:38,848 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2022-11-20 12:09:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:38,856 INFO L225 Difference]: With dead ends: 1009 [2022-11-20 12:09:38,856 INFO L226 Difference]: Without dead ends: 1003 [2022-11-20 12:09:38,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-20 12:09:38,861 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 543 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:09:38,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 578 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:09:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-11-20 12:09:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2022-11-20 12:09:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-11-20 12:09:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2022-11-20 12:09:38,980 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2022-11-20 12:09:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:38,981 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2022-11-20 12:09:38,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-11-20 12:09:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2022-11-20 12:09:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-11-20 12:09:39,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:39,002 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:39,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:39,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 12:09:39,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2022-11-20 12:09:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:39,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490143057] [2022-11-20 12:09:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:39,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:09:39,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69595926] [2022-11-20 12:09:39,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:09:39,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:39,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:39,254 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:09:39,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:09:39,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2022-11-20 12:09:39,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 12:09:39,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:09:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:09:40,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:09:40,426 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:09:40,428 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:09:40,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:09:40,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:09:40,647 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2022-11-20 12:09:40,655 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:09:40,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:09:40 BoogieIcfgContainer [2022-11-20 12:09:40,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:09:40,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:09:40,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:09:40,910 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:09:40,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:05" (3/4) ... [2022-11-20 12:09:40,913 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:09:41,109 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:09:41,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:09:41,110 INFO L158 Benchmark]: Toolchain (without parser) took 36018.14ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 139.0MB in the beginning and 129.7MB in the end (delta: 9.3MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,110 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 136.3MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:09:41,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.00ms. Allocated memory is still 169.9MB. Free memory was 139.0MB in the beginning and 128.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.43ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 126.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,111 INFO L158 Benchmark]: Boogie Preprocessor took 19.45ms. Allocated memory is still 169.9MB. Free memory was 126.7MB in the beginning and 125.8MB in the end (delta: 890.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,112 INFO L158 Benchmark]: RCFGBuilder took 356.23ms. Allocated memory is still 169.9MB. Free memory was 125.8MB in the beginning and 114.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,112 INFO L158 Benchmark]: TraceAbstraction took 35166.98ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 114.2MB in the beginning and 150.7MB in the end (delta: -36.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,113 INFO L158 Benchmark]: Witness Printer took 199.14ms. Allocated memory is still 247.5MB. Free memory was 150.7MB in the beginning and 129.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:09:41,115 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.25ms. Allocated memory is still 136.3MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.00ms. Allocated memory is still 169.9MB. Free memory was 139.0MB in the beginning and 128.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.43ms. Allocated memory is still 169.9MB. Free memory was 128.5MB in the beginning and 126.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.45ms. Allocated memory is still 169.9MB. Free memory was 126.7MB in the beginning and 125.8MB in the end (delta: 890.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.23ms. Allocated memory is still 169.9MB. Free memory was 125.8MB in the beginning and 114.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35166.98ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 114.2MB in the beginning and 150.7MB in the end (delta: -36.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 199.14ms. Allocated memory is still 247.5MB. Free memory was 150.7MB in the beginning and 129.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.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=-193, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-193, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-193, x=0, x=0, X=197, 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=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=-193, x=0, x=0, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, x=0, x=0, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-189, x=0, x=0, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=1, v=-189, x=0, X=197, x=1, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, x=1, X=197, x=0, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-189, X=197, x=2, x=1, 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=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=-189, x=1, X=197, x=0, x=2, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=2, x=1, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, X=197, x=2, x=1, x=0, Y=2, y=0] [L45] x++ VAL [counter=2, v=-185, x=2, x=2, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, x=2, x=2, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-185, x=0, x=2, X=197, x=4, Y=2, y=0] [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=-185, x=4, x=2, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, x=0, x=4, x=2, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=0, x=4, x=2, X=197, Y=2, y=0] [L45] x++ VAL [counter=3, v=-181, x=4, x=3, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, x=3, x=0, X=197, x=4, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-181, X=197, x=6, x=3, 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=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=-181, X=197, x=0, x=6, x=3, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, x=3, X=197, x=0, x=6, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, x=6, x=3, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=4, v=-177, x=0, x=6, x=4, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, x=6, X=197, x=0, x=4, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, X=197, x=4, x=8, 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=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=-177, x=4, x=8, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, X=197, x=8, x=4, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, x=0, X=197, x=8, x=4, Y=2, y=0] [L45] x++ VAL [counter=5, v=-173, x=5, x=0, x=8, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=5, x=8, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-173, X=197, x=0, x=5, x=10, y=0, Y=2] [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=-173, X=197, x=0, x=10, x=5, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, x=5, X=197, x=10, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, X=197, x=5, x=10, x=0, Y=2, y=0] [L45] x++ VAL [counter=6, v=-169, x=6, X=197, x=0, x=10, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, x=0, x=10, X=197, x=6, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-169, x=0, X=197, x=12, x=6, y=0, Y=2] [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=-169, x=12, x=6, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, x=0, x=12, x=6, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=0, x=12, X=197, x=6, y=0, Y=2] [L45] x++ VAL [counter=7, v=-165, x=12, x=7, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=12, x=0, X=197, x=7, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-165, x=0, x=14, x=7, X=197, 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=-165, X=197, x=14, x=7, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-165, x=14, X=197, x=0, x=7, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, x=0, x=7, X=197, x=14, Y=2, y=0] [L45] x++ VAL [counter=8, v=-161, x=14, x=8, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, X=197, x=8, x=0, x=14, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-161, X=197, x=16, x=8, 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=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=-161, X=197, x=0, x=16, x=8, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, X=197, x=16, x=8, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, X=197, x=8, x=0, x=16, y=0, Y=2] [L45] x++ VAL [counter=9, v=-157, x=16, x=9, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, x=0, x=16, X=197, x=9, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-157, x=18, x=0, X=197, x=9, 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=-157, x=0, X=197, x=18, x=9, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, x=18, x=9, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, X=197, x=0, x=18, x=9, y=0, Y=2] [L45] x++ VAL [counter=10, v=-153, x=0, x=18, x=10, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, X=197, x=10, x=0, x=18, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, x=10, X=197, 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=-153, x=0, x=20, X=197, x=10, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, x=20, x=0, x=10, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, x=10, X=197, x=0, x=20, y=0, Y=2] [L45] x++ VAL [counter=11, v=-149, x=20, X=197, x=11, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, x=0, x=11, X=197, x=20, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, X=197, x=0, x=22, 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=-149, x=22, x=11, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, x=11, X=197, x=0, x=22, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, x=11, x=0, x=22, X=197, y=0, Y=2] [L45] x++ VAL [counter=12, v=-145, x=22, X=197, x=0, x=12, y=0, Y=2] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, x=0, x=22, x=12, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-145, X=197, x=12, x=24, 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=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=-145, x=24, X=197, x=0, x=12, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, x=12, x=0, x=24, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, x=12, x=24, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=13, v=-141, x=0, x=13, x=24, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=0, x=13, x=24, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-141, x=26, x=13, x=0, X=197, 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=-141, X=197, x=0, x=26, x=13, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=0, x=26, x=13, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, X=197, x=0, x=26, x=13, y=0, Y=2] [L45] x++ VAL [counter=14, v=-137, x=0, x=26, x=14, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, x=0, X=197, x=26, x=14, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-137, x=14, x=28, X=197, 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=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=-137, x=28, x=0, x=14, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=28, x=14, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, x=0, X=197, x=14, x=28, Y=2, y=0] [L45] x++ VAL [counter=15, v=-133, x=15, X=197, x=28, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, x=15, X=197, x=0, x=28, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, x=30, x=15, x=0, X=197, Y=2, y=0] [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=-133, x=30, x=15, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, x=15, x=30, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, x=15, x=0, x=30, X=197, y=0, Y=2] [L45] x++ VAL [counter=16, v=-129, x=30, x=0, X=197, x=16, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, x=0, x=16, X=197, x=30, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-129, X=197, x=16, x=32, 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=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=-129, X=197, x=0, x=16, x=32, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, x=16, X=197, x=0, x=32, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, x=0, x=16, x=32, X=197, y=0, Y=2] [L45] x++ VAL [counter=17, v=-125, x=17, x=32, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, x=0, x=32, X=197, x=17, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-125, X=197, x=0, x=34, x=17, 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=-125, x=0, X=197, x=34, x=17, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, x=17, x=34, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, x=17, x=0, x=34, X=197, Y=2, y=0] [L45] x++ VAL [counter=18, v=-121, x=18, X=197, x=34, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, x=34, x=0, x=18, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-121, x=36, x=0, X=197, 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=-121, x=18, X=197, x=0, x=36, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, x=36, x=18, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, x=36, X=197, x=0, x=18, Y=2, y=0] [L45] x++ VAL [counter=19, v=-117, x=36, x=19, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, X=197, x=0, x=36, x=19, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, x=19, x=0, X=197, x=38, Y=2, y=0] [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=-117, x=38, x=0, X=197, x=19, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, x=0, x=38, x=19, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, x=19, x=0, X=197, x=38, y=0, Y=2] [L45] x++ VAL [counter=20, v=-113, x=20, x=0, X=197, x=38, Y=2, y=0] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, X=197, x=20, x=0, x=38, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-113, x=40, x=20, x=0, X=197, y=0, Y=2] [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=-113, x=0, X=197, x=20, x=40, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, x=20, x=0, X=197, x=40, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, x=0, X=197, x=20, x=40, y=0, Y=2] [L45] x++ VAL [counter=21, v=-109, x=21, X=197, x=0, x=40, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, x=21, x=40, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-109, x=42, x=21, X=197, 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=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=-109, X=197, x=21, x=42, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, X=197, x=21, x=42, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, X=197, x=42, x=0, x=21, Y=2, y=0] [L45] x++ VAL [counter=22, v=-105, x=0, x=22, X=197, x=42, y=0, Y=2] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, x=0, x=22, x=42, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-105, X=197, x=22, x=44, 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=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=-105, x=0, x=44, X=197, x=22, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, x=22, x=0, X=197, x=44, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, x=0, X=197, x=22, x=44, Y=2, y=0] [L45] x++ VAL [counter=23, v=-101, x=23, x=0, X=197, x=44, y=0, Y=2] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, X=197, x=0, x=44, x=23, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-101, X=197, x=0, x=46, x=23, 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=-101, x=46, x=0, X=197, x=23, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, x=0, x=23, x=46, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-97, x=46, x=0, X=197, x=23, Y=2, y=0] [L45] x++ VAL [counter=24, v=-97, x=24, X=197, x=46, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, x=0, x=46, x=24, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-97, x=24, x=0, x=48, X=197, y=0, Y=2] [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=-97, x=24, X=197, x=48, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, x=24, x=48, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-93, x=48, X=197, x=0, x=24, Y=2, y=0] [L45] x++ VAL [counter=25, v=-93, X=197, x=48, x=0, x=25, Y=2, y=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-93, x=48, X=197, x=0, x=25, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-93, X=197, x=0, x=50, x=25, Y=2, y=0] [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=-93, x=0, x=50, X=197, x=25, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, x=0, x=25, X=197, x=50, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, x=25, X=197, x=50, x=0, y=0, Y=2] [L45] x++ VAL [counter=26, v=-89, x=0, x=26, X=197, x=50, y=0, Y=2] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, x=26, x=0, x=50, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-89, X=197, x=26, 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=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=-89, x=26, x=52, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, x=52, X=197, x=0, x=26, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, X=197, x=26, x=0, x=52, Y=2, y=0] [L45] x++ VAL [counter=27, v=-85, x=52, X=197, x=27, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, x=27, x=52, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-85, x=54, x=27, x=0, X=197, y=0, Y=2] [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=-85, X=197, x=0, x=27, x=54, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, X=197, x=0, x=27, x=54, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, X=197, x=27, x=0, x=54, Y=2, y=0] [L45] x++ VAL [counter=28, v=-81, X=197, x=0, x=54, x=28, y=0, Y=2] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, x=28, x=0, X=197, x=54, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-81, X=197, x=0, x=56, x=28, 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=-81, x=28, x=56, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, x=0, x=28, x=56, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, x=0, x=28, X=197, x=56, y=0, Y=2] [L45] x++ VAL [counter=29, v=-77, x=0, x=29, X=197, x=56, Y=2, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, x=29, x=0, X=197, x=56, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-77, x=0, X=197, x=58, x=29, 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=-77, X=197, x=29, x=0, x=58, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, x=58, x=0, x=29, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, X=197, x=29, x=0, x=58, y=0, Y=2] [L45] x++ VAL [counter=30, v=-73, x=0, x=58, x=30, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, x=0, x=30, X=197, x=58, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-73, x=0, X=197, x=60, x=30, 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=-73, x=30, X=197, x=60, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, x=60, x=30, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, X=197, x=60, x=0, x=30, Y=2, y=0] [L45] x++ VAL [counter=31, v=-69, x=31, X=197, x=0, x=60, y=0, Y=2] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=0, x=60, X=197, x=31, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, X=197, x=0, x=62, x=31, 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=-69, x=62, x=31, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, x=62, x=31, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, x=31, x=0, x=62, X=197, Y=2, y=0] [L45] x++ VAL [counter=32, v=-65, x=0, x=32, x=62, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, x=32, x=62, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-65, x=0, x=32, x=64, X=197, 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=-65, x=0, x=64, X=197, x=32, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, X=197, x=64, x=32, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, x=0, X=197, x=32, x=64, Y=2, y=0] [L45] x++ VAL [counter=33, v=-61, x=0, X=197, x=33, x=64, y=0, Y=2] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, x=33, x=0, x=64, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, X=197, x=0, x=66, x=33, Y=2, y=0] [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=-61, x=33, X=197, x=0, x=66, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, x=66, x=33, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, x=33, x=66, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=34, v=-57, X=197, x=66, x=0, x=34, y=0, Y=2] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, x=0, X=197, x=66, x=34, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-57, X=197, x=68, x=0, x=34, 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=-57, x=0, x=34, X=197, x=68, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, X=197, x=34, x=68, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=0, X=197, x=34, x=68, Y=2, y=0] [L45] x++ VAL [counter=35, v=-53, x=0, X=197, x=68, x=35, Y=2, y=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, x=68, x=35, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-53, x=0, x=35, X=197, x=70, 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=-53, x=70, X=197, x=0, x=35, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, x=35, x=70, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, x=35, x=70, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=36, v=-49, x=36, x=0, X=197, x=70, y=0, Y=2] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, x=70, x=0, x=36, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-49, x=36, x=0, x=72, X=197, 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=-49, x=36, X=197, x=72, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, x=72, x=36, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, x=36, x=72, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=37, v=-45, X=197, x=72, x=37, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, x=72, X=197, x=37, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-45, x=37, x=0, x=74, X=197, y=0, Y=2] [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=-45, x=37, x=0, x=74, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, X=197, x=74, x=0, x=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, X=197, x=74, x=0, x=37, y=0, Y=2] [L45] x++ VAL [counter=38, v=-41, x=74, X=197, x=0, x=38, Y=2, y=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, x=38, X=197, x=74, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-41, x=76, X=197, x=0, x=38, 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=-41, X=197, x=0, x=76, x=38, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, X=197, x=0, x=76, x=38, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, X=197, x=38, x=76, x=0, Y=2, y=0] [L45] x++ VAL [counter=39, v=-37, X=197, x=76, x=39, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, x=76, X=197, x=0, x=39, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-37, X=197, x=78, x=39, 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=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=-37, x=39, x=0, X=197, x=78, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, x=78, x=0, x=39, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, x=78, x=39, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=40, v=-33, X=197, x=0, x=78, x=40, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, x=40, x=78, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-33, x=0, X=197, x=40, x=80, 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=-33, x=40, x=80, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, X=197, x=0, x=80, x=40, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, x=80, x=40, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=41, v=-29, x=0, x=80, X=197, x=41, y=0, Y=2] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, x=41, x=0, X=197, x=80, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-29, x=0, x=82, x=41, X=197, Y=2, y=0] [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=-29, x=0, X=197, x=82, x=41, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, X=197, x=82, x=0, x=41, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-25, x=82, X=197, x=0, x=41, Y=2, y=0] [L45] x++ VAL [counter=42, v=-25, X=197, x=0, x=82, x=42, Y=2, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, x=82, x=0, X=197, x=42, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-25, x=84, x=0, x=42, X=197, 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=-25, x=0, x=42, x=84, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, X=197, x=0, x=42, x=84, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=84, X=197, x=42, x=0, Y=2, y=0] [L45] x++ VAL [counter=43, v=-21, x=0, x=43, x=84, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, X=197, x=43, x=84, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-21, x=0, x=43, X=197, x=86, Y=2, y=0] [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=-21, x=86, X=197, x=0, x=43, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, x=86, x=43, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, x=0, X=197, x=43, x=86, Y=2, y=0] [L45] x++ VAL [counter=44, v=-17, x=44, x=0, x=86, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, X=197, x=0, x=86, x=44, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-17, X=197, x=0, x=88, 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=-17, x=44, X=197, x=0, x=88, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=0, x=44, X=197, x=88, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, x=0, x=44, x=88, X=197, y=0, Y=2] [L45] x++ VAL [counter=45, v=-13, x=45, X=197, x=88, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=45, x=0, X=197, x=88, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-13, x=0, X=197, x=45, 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=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=-13, x=0, x=90, X=197, x=45, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, x=90, x=0, X=197, x=45, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, x=45, x=0, x=90, X=197, y=0, Y=2] [L45] x++ VAL [counter=46, v=-9, x=46, x=90, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, X=197, x=90, x=46, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-9, X=197, x=92, x=46, 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=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=-9, x=46, X=197, x=0, x=92, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, x=46, x=92, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, x=46, X=197, x=92, x=0, y=0, Y=2] [L45] x++ VAL [counter=47, v=-5, x=0, X=197, x=92, x=47, y=0, Y=2] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=47, X=197, x=92, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-5, x=47, x=0, x=94, X=197, 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=-5, x=47, x=94, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, X=197, x=47, x=94, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, x=47, X=197, x=94, x=0, Y=2, y=0] [L45] x++ VAL [counter=48, v=-1, x=0, x=48, x=94, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=0, x=94, x=48, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, x=48, x=0, x=96, X=197, Y=2, y=0] [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=-1, x=96, X=197, x=48, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, X=197, x=48, x=0, x=96, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, X=197, x=48, x=0, x=96, Y=2, y=0] [L45] x++ VAL [counter=49, v=3, X=197, x=0, x=96, x=49, Y=2, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=0, X=197, x=96, x=49, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=3, X=197, x=98, x=49, 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=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=3, x=98, X=197, x=49, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, x=49, x=0, x=98, X=197, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-387, x=0, X=197, x=98, x=49, Y=2, y=1] [L45] x++ VAL [counter=50, v=-387, x=98, x=50, X=197, x=0, y=1, Y=2] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, X=197, x=50, x=0, x=98, y=1, Y=2] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-387, x=50, X=197, x=50, x=100, Y=2, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.8s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1696 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1695 mSDsluCounter, 1904 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1653 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 251 mSDtfsCounter, 1633 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 2043 SyntacticMatches, 45 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4427 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 0 QuantifiedInterpolants, 6663 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10288/31834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 12:09:41,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0914c6c6-f1b8-47d0-8f17-b9e4ebbe6d24/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE