./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-5e519f3 [2022-11-03 02:12:15,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:12:15,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:12:15,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:12:15,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:12:15,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:12:15,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:12:15,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:12:15,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:12:15,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:12:15,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:12:15,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:12:15,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:12:15,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:12:15,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:12:15,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:12:15,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:12:15,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:12:15,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:12:15,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:12:15,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:12:15,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:12:15,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:12:15,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:12:15,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:12:15,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:12:15,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:12:15,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:12:15,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:12:15,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:12:15,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:12:15,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:12:15,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:12:15,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:12:15,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:12:15,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:12:15,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:12:15,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:12:15,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:12:15,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:12:15,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:12:15,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:12:15,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:12:15,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:12:15,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:12:15,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:12:15,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:12:15,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:12:15,811 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:12:15,811 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:12:15,811 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:12:15,811 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:12:15,812 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:12:15,828 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:12:15,828 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:12:15,828 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:12:15,828 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:12:15,829 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:12:15,829 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:12:15,829 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:12:15,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:12:15,830 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:12:15,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:12:15,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:12:15,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:12:15,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:12:15,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:12:15,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:12:15,831 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:12:15,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:12:15,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:12:15,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:12:15,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:12:15,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:12:15,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:12:15,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:12:15,833 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:12:15,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:12:15,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:12:15,834 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:12:15,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:12:15,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:12:15,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:12:15,834 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_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2022-11-03 02:12:16,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:12:16,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:12:16,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:12:16,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:12:16,165 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:12:16,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-03 02:12:16,250 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/data/cc5f5f61c/3d459bbae5784abb89ab506d6fa71e33/FLAG244dba128 [2022-11-03 02:12:16,751 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:12:16,751 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-03 02:12:16,761 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/data/cc5f5f61c/3d459bbae5784abb89ab506d6fa71e33/FLAG244dba128 [2022-11-03 02:12:17,099 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/data/cc5f5f61c/3d459bbae5784abb89ab506d6fa71e33 [2022-11-03 02:12:17,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:12:17,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:12:17,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:12:17,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:12:17,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:12:17,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d0712b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17, skipping insertion in model container [2022-11-03 02:12:17,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:12:17,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:12:17,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-03 02:12:17,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:12:17,346 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:12:17,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-03 02:12:17,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:12:17,394 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:12:17,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17 WrapperNode [2022-11-03 02:12:17,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:12:17,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:12:17,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:12:17,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:12:17,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,433 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-03 02:12:17,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:12:17,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:12:17,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:12:17,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:12:17,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,465 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:12:17,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:12:17,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:12:17,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:12:17,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (1/1) ... [2022-11-03 02:12:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:12:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:17,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:12:17,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:12:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:12:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:12:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:12:17,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:12:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 02:12:17,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 02:12:17,614 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:12:17,616 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:12:17,815 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:12:17,872 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:12:17,882 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:12:17,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:12:17 BoogieIcfgContainer [2022-11-03 02:12:17,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:12:17,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:12:17,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:12:17,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:12:17,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:12:17" (1/3) ... [2022-11-03 02:12:17,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2687b1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:12:17, skipping insertion in model container [2022-11-03 02:12:17,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:12:17" (2/3) ... [2022-11-03 02:12:17,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2687b1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:12:17, skipping insertion in model container [2022-11-03 02:12:17,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:12:17" (3/3) ... [2022-11-03 02:12:17,899 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-11-03 02:12:17,918 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:12:17,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:12:17,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:12:18,000 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f913a64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:12:18,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:12:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-03 02:12:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:12:18,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:18,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:18,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-11-03 02:12:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552033567] [2022-11-03 02:12:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:18,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:18,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663465651] [2022-11-03 02:12:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:18,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:18,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:18,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:18,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:12:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:18,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:12:18,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:18,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:12:18,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:18,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552033567] [2022-11-03 02:12:18,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:18,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663465651] [2022-11-03 02:12:18,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663465651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:12:18,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:12:18,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:12:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387299791] [2022-11-03 02:12:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:12:18,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:12:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:12:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:12:18,485 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:18,731 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-11-03 02:12:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:12:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 02:12:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:18,741 INFO L225 Difference]: With dead ends: 42 [2022-11-03 02:12:18,742 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:12:18,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03 02:12:18,748 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:18,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:12:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:12:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 02:12:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-03 02:12:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-03 02:12:18,789 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-11-03 02:12:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:18,789 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-03 02:12:18,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-03 02:12:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:12:18,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:18,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:18,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:19,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:19,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-11-03 02:12:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:19,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305543591] [2022-11-03 02:12:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:19,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:19,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971070773] [2022-11-03 02:12:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:19,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:19,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:19,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:12:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:19,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 02:12:19,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:19,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:19,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:19,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305543591] [2022-11-03 02:12:19,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971070773] [2022-11-03 02:12:19,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971070773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323304571] [2022-11-03 02:12:19,945 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 02:12:19,946 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:19,949 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:19,954 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:19,955 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:20,622 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-11-03 02:12:20,675 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:23,536 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '225#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (< ~counter~0 51) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:12:23,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:23,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:23,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-11-03 02:12:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270909298] [2022-11-03 02:12:23,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:12:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:12:23,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=252, Unknown=1, NotChecked=0, Total=306 [2022-11-03 02:12:23,540 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:12:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:24,173 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-11-03 02:12:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:12:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-11-03 02:12:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:24,175 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:12:24,176 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 02:12:24,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=79, Invalid=382, Unknown=1, NotChecked=0, Total=462 [2022-11-03 02:12:24,178 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:24,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:12:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 02:12:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-11-03 02:12:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-03 02:12:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-03 02:12:24,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-11-03 02:12:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:24,190 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-03 02:12:24,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:12:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-03 02:12:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:12:24,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:24,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:24,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:24,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:24,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-11-03 02:12:24,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:24,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735373536] [2022-11-03 02:12:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:24,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:24,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009375998] [2022-11-03 02:12:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:24,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:24,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:12:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:24,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:12:24,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:24,535 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-03 02:12:24,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:24,595 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-03 02:12:24,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:24,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735373536] [2022-11-03 02:12:24,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:24,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009375998] [2022-11-03 02:12:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009375998] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:24,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1007346152] [2022-11-03 02:12:24,599 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:12:24,600 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:24,600 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:24,600 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:24,601 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:25,092 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 02:12:25,272 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:26,362 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '416#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 02:12:26,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:26,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:26,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-03 02:12:26,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556902934] [2022-11-03 02:12:26,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:26,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:12:26,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:26,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:12:26,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:12:26,364 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-03 02:12:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:26,505 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-11-03 02:12:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:12:26,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 16 [2022-11-03 02:12:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:26,507 INFO L225 Difference]: With dead ends: 59 [2022-11-03 02:12:26,507 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 02:12:26,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:12:26,509 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:26,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 74 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:12:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 02:12:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-11-03 02:12:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-03 02:12:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-11-03 02:12:26,533 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-11-03 02:12:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:26,533 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-11-03 02:12:26,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-03 02:12:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-11-03 02:12:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:12:26,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:26,534 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:26,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:26,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:26,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-11-03 02:12:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:26,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654993307] [2022-11-03 02:12:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:26,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55801355] [2022-11-03 02:12:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:26,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:26,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:26,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:12:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:26,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:12:26,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:27,484 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-03 02:12:27,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:28,067 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-03 02:12:28,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654993307] [2022-11-03 02:12:28,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55801355] [2022-11-03 02:12:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55801355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1427507121] [2022-11-03 02:12:28,082 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:12:28,084 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:28,084 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:28,085 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:28,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:28,600 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-11-03 02:12:28,919 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:35,362 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '712#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (< ~counter~0 51) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:12:35,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:35,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:35,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-11-03 02:12:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797061992] [2022-11-03 02:12:35,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:12:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:12:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:12:35,364 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:12:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:36,185 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-11-03 02:12:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:12:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2022-11-03 02:12:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:36,187 INFO L225 Difference]: With dead ends: 49 [2022-11-03 02:12:36,187 INFO L226 Difference]: Without dead ends: 41 [2022-11-03 02:12:36,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 02:12:36,189 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:36,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 45 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:12:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-03 02:12:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-03 02:12:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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-03 02:12:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-11-03 02:12:36,203 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-11-03 02:12:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:36,203 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-11-03 02:12:36,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:12:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-11-03 02:12:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:12:36,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:36,205 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:36,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:36,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:36,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-11-03 02:12:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:36,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184980045] [2022-11-03 02:12:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:36,440 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:36,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708218194] [2022-11-03 02:12:36,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:12:36,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:36,446 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:36,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:12:36,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 02:12:36,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:12:36,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:12:36,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:36,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:12:36,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:36,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184980045] [2022-11-03 02:12:36,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:36,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708218194] [2022-11-03 02:12:36,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708218194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:36,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86547071] [2022-11-03 02:12:36,847 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:12:36,847 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:36,847 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:36,847 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:36,847 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:37,243 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 02:12:37,362 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:44,299 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1111#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:12:44,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:44,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-03 02:12:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833557243] [2022-11-03 02:12:44,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:44,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:12:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:44,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:12:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:12:44,301 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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-03 02:12:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:44,651 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-11-03 02:12:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:12:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 40 [2022-11-03 02:12:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:44,653 INFO L225 Difference]: With dead ends: 95 [2022-11-03 02:12:44,653 INFO L226 Difference]: Without dead ends: 89 [2022-11-03 02:12:44,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 02:12:44,655 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:44,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:12:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-03 02:12:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-03 02:12:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 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-03 02:12:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-11-03 02:12:44,683 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-11-03 02:12:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:44,683 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-11-03 02:12:44,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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-03 02:12:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-11-03 02:12:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 02:12:44,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:44,686 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:44,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:44,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:44,901 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-11-03 02:12:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:44,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106562393] [2022-11-03 02:12:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:44,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:44,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196239753] [2022-11-03 02:12:44,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:12:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:44,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:44,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:12:45,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:12:45,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:12:45,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:12:45,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:45,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-03 02:12:45,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106562393] [2022-11-03 02:12:45,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196239753] [2022-11-03 02:12:45,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196239753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [243556470] [2022-11-03 02:12:45,815 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:12:45,815 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:45,815 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:45,816 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:45,816 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:46,227 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 02:12:46,352 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:47,809 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1939#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:12:47,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:47,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:47,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-03 02:12:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11601003] [2022-11-03 02:12:47,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:47,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 02:12:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 02:12:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:12:47,812 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 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-03 02:12:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:48,789 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-11-03 02:12:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 02:12:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 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 88 [2022-11-03 02:12:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:48,791 INFO L225 Difference]: With dead ends: 191 [2022-11-03 02:12:48,792 INFO L226 Difference]: Without dead ends: 185 [2022-11-03 02:12:48,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2022-11-03 02:12:48,794 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 182 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:48,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 152 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:12:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-03 02:12:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-03 02:12:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 139 states have (on average 1.0071942446043165) internal successors, (140), 139 states have internal predecessors, (140), 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-03 02:12:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-11-03 02:12:48,850 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-11-03 02:12:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:48,851 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-11-03 02:12:48,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 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-03 02:12:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-11-03 02:12:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-03 02:12:48,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:48,854 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:48,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 02:12:49,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-11-03 02:12:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889041677] [2022-11-03 02:12:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:49,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:49,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176637376] [2022-11-03 02:12:49,104 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:12:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:49,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:49,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:12:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:49,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:12:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:12:50,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-11-03 02:12:51,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:12:51,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889041677] [2022-11-03 02:12:51,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:12:51,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176637376] [2022-11-03 02:12:51,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176637376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:51,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1792741651] [2022-11-03 02:12:51,408 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:12:51,408 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:12:51,409 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:12:51,409 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:12:51,409 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:12:51,854 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 02:12:51,981 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:12:54,578 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3655#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:12:54,578 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:12:54,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:12:54,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-03 02:12:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392014140] [2022-11-03 02:12:54,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:54,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:12:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:12:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:12:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=2375, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 02:12:54,583 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 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-03 02:12:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:57,358 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-11-03 02:12:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-03 02:12:57,359 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 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 184 [2022-11-03 02:12:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:57,362 INFO L225 Difference]: With dead ends: 383 [2022-11-03 02:12:57,363 INFO L226 Difference]: Without dead ends: 377 [2022-11-03 02:12:57,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3348, Invalid=7572, Unknown=0, NotChecked=0, Total=10920 [2022-11-03 02:12:57,366 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 437 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:57,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 332 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:12:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-03 02:12:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-03 02:12:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 283 states have (on average 1.0035335689045937) internal successors, (284), 283 states have internal predecessors, (284), 47 states have call successors, (47), 47 states have call predecessors, (47), 46 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 02:12:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-11-03 02:12:57,454 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-11-03 02:12:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:57,455 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-11-03 02:12:57,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 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-03 02:12:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-11-03 02:12:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-03 02:12:57,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:57,462 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:57,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:57,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:12:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-11-03 02:12:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:12:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116410585] [2022-11-03 02:12:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:12:57,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:12:57,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041500757] [2022-11-03 02:12:57,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:12:57,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:57,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:57,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:13:35,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-03 02:13:35,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:35,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-03 02:13:35,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:37,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-11-03 02:13:40,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116410585] [2022-11-03 02:13:40,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:13:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041500757] [2022-11-03 02:13:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041500757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805228409] [2022-11-03 02:13:40,010 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:13:40,010 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:13:40,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:13:40,010 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:13:40,011 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:13:40,386 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-03 02:13:40,497 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:13:44,961 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7103#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 02:13:44,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:13:44,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:13:44,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-03 02:13:44,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556465655] [2022-11-03 02:13:44,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:44,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-03 02:13:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-03 02:13:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=2668, Unknown=1, NotChecked=0, Total=4032 [2022-11-03 02:13:44,966 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand has 54 states, 54 states have (on average 5.518518518518518) internal successors, (298), 54 states have internal predecessors, (298), 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-03 02:13:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:47,964 INFO L93 Difference]: Finished difference Result 415 states and 418 transitions. [2022-11-03 02:13:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-03 02:13:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.518518518518518) internal successors, (298), 54 states have internal predecessors, (298), 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 376 [2022-11-03 02:13:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:47,968 INFO L225 Difference]: With dead ends: 415 [2022-11-03 02:13:47,968 INFO L226 Difference]: Without dead ends: 409 [2022-11-03 02:13:47,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1175 GetRequests, 1020 SyntacticMatches, 44 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3958, Invalid=8697, Unknown=1, NotChecked=0, Total=12656 [2022-11-03 02:13:47,972 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 291 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:47,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 338 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:13:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-03 02:13:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-11-03 02:13:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 307 states have (on average 1.003257328990228) internal successors, (308), 307 states have internal predecessors, (308), 51 states have call successors, (51), 51 states have call predecessors, (51), 50 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-03 02:13:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2022-11-03 02:13:48,100 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 376 [2022-11-03 02:13:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:48,102 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2022-11-03 02:13:48,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.518518518518518) internal successors, (298), 54 states have internal predecessors, (298), 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-03 02:13:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2022-11-03 02:13:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-11-03 02:13:48,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:48,118 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:48,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:48,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -138579467, now seen corresponding path program 6 times [2022-11-03 02:13:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961815355] [2022-11-03 02:13:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:48,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:13:48,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413001765] [2022-11-03 02:13:48,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:13:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:48,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:48,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:13:50,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:13:50,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-03 02:13:50,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:13:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:13:52,827 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:13:52,827 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:13:52,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:13:52,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-03 02:13:53,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:53,055 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-11-03 02:13:53,059 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:13:53,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:13:53 BoogieIcfgContainer [2022-11-03 02:13:53,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:13:53,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:13:53,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:13:53,231 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:13:53,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:12:17" (3/4) ... [2022-11-03 02:13:53,233 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:13:53,373 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:13:53,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:13:53,374 INFO L158 Benchmark]: Toolchain (without parser) took 96267.05ms. Allocated memory was 102.8MB in the beginning and 174.1MB in the end (delta: 71.3MB). Free memory was 57.6MB in the beginning and 139.3MB in the end (delta: -81.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2022-11-03 02:13:53,375 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:13:53,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.81ms. Allocated memory is still 102.8MB. Free memory was 57.4MB in the beginning and 77.0MB in the end (delta: -19.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:13:53,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.84ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 75.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:13:53,376 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 74.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:13:53,376 INFO L158 Benchmark]: RCFGBuilder took 416.84ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 61.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:13:53,376 INFO L158 Benchmark]: TraceAbstraction took 95342.97ms. Allocated memory was 102.8MB in the beginning and 174.1MB in the end (delta: 71.3MB). Free memory was 61.0MB in the beginning and 61.4MB in the end (delta: -378.0kB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-11-03 02:13:53,377 INFO L158 Benchmark]: Witness Printer took 143.24ms. Allocated memory is still 174.1MB. Free memory was 61.4MB in the beginning and 139.3MB in the end (delta: -77.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-03 02:13:53,378 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.18ms. Allocated memory is still 102.8MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.81ms. Allocated memory is still 102.8MB. Free memory was 57.4MB in the beginning and 77.0MB in the end (delta: -19.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.84ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 75.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 74.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.84ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 61.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 95342.97ms. Allocated memory was 102.8MB in the beginning and 174.1MB in the end (delta: 71.3MB). Free memory was 61.0MB in the beginning and 61.4MB in the end (delta: -378.0kB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Witness Printer took 143.24ms. Allocated memory is still 174.1MB. Free memory was 61.4MB in the beginning and 139.3MB in the end (delta: -77.9MB). Peak memory consumption was 18.9MB. 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; [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=-45, X=59, x=0, y=0, Y=7] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-45, X=59, x=0, y=0, Y=7] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-45, x=0, X=59, x=0, x=0, y=0, Y=7] [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=-45, x=0, X=59, x=0, x=0, Y=7, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=1, v=-31, X=59, x=0, x=0, x=1, y=0, Y=7, y++=83] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-31, x=0, x=0, x=1, X=59, Y=7, y=0, y++=83] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-31, X=59, x=0, x=1, x=7, Y=7, y=0, y++=83] [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=-31, x=0, x=1, x=7, X=59, Y=7, y=0, y++=83] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=2, v=-17, x=2, X=59, x=0, x=7, Y=7, y=0, y++=83] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-17, x=7, x=0, X=59, x=2, y=0, Y=7, y++=83] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-17, x=2, x=14, x=0, X=59, Y=7, y=0, y++=83] [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=-17, x=14, x=2, x=0, X=59, y=0, Y=7, y++=83] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=3, v=-3, x=0, X=59, x=3, x=14, y=0, Y=7, y++=83] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-3, x=14, X=59, x=0, x=3, y=0, Y=7, y++=83] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-3, x=21, X=59, x=3, x=0, y=0, Y=7, y++=83] [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=-3, X=59, x=0, x=21, x=3, Y=7, y=0, y++=83] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=4, v=11, X=59, x=4, x=0, x=21, y=0, Y=7, y++=83] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=11, X=59, x=0, x=21, x=4, Y=7, y=0, y++=83] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=11, x=4, x=0, x=28, X=59, Y=7, y=0, y++=83] [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=11, x=28, x=4, x=0, X=59, y=0, Y=7, y++=83] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=5, v=-93, x=0, X=59, x=5, x=28, Y=7, y=1, y++=148] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-93, x=5, X=59, x=0, x=28, y=1, Y=7, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-93, x=5, X=59, x=35, x=59, Y=7, y=1, y++=148] [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=-93, x=5, x=59, x=35, X=59, y=1, Y=7, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=6, v=-79, x=59, X=59, x=35, x=6, y=1, Y=7, y++=148] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-79, x=35, x=59, X=59, x=6, Y=7, y=1, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-79, x=6, X=59, x=59, x=42, Y=7, y=1, y++=148] [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=-79, x=59, x=42, X=59, x=6, y=1, Y=7, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=7, v=-65, x=7, x=59, x=42, X=59, y=1, Y=7, y++=148] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-65, x=42, x=7, x=59, X=59, Y=7, y=1, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-65, x=49, x=59, x=7, X=59, y=1, Y=7, y++=148] [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=-65, x=7, X=59, x=49, x=59, Y=7, y=1, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=8, v=-51, x=59, x=8, x=49, X=59, y=1, Y=7, y++=148] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-51, x=59, x=8, x=49, X=59, Y=7, y=1, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-51, x=56, X=59, x=59, x=8, Y=7, y=1, y++=148] [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=-51, x=8, x=59, X=59, x=56, y=1, Y=7, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=9, v=-37, x=59, x=56, X=59, x=9, Y=7, y=1, y++=148] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-37, x=56, x=59, X=59, x=9, y=1, Y=7, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-37, x=9, x=63, x=59, X=59, y=1, Y=7, y++=148] [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=-37, x=63, X=59, x=59, x=9, y=1, Y=7, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=10, v=-23, x=10, x=63, x=59, X=59, y=1, Y=7, y++=148] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-23, x=63, x=10, x=59, X=59, Y=7, y=1, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-23, x=70, x=10, x=59, X=59, y=1, Y=7, y++=148] [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=-23, x=10, x=70, X=59, x=59, Y=7, y=1, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=11, v=-9, X=59, x=11, x=70, x=59, y=1, Y=7, y++=148] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-9, x=70, X=59, x=59, x=11, Y=7, y=1, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-9, x=59, X=59, x=11, x=77, y=1, Y=7, y++=148] [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=-9, x=59, x=11, X=59, x=77, y=1, Y=7, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=12, v=5, X=59, x=59, x=77, x=12, Y=7, y=1, y++=148] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=5, x=59, X=59, x=77, x=12, y=1, Y=7, y++=148] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=5, x=84, X=59, x=59, x=12, Y=7, y=1, y++=148] [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=5, X=59, x=84, x=12, x=59, Y=7, y=1, y++=148] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=13, v=-99, x=84, x=59, X=59, x=13, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-99, x=59, X=59, x=13, x=84, y=2, Y=7, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-99, X=59, x=13, x=91, x=118, y=2, Y=7, y++=216] [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=-99, X=59, x=91, x=118, x=13, y=2, Y=7, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=14, v=-85, x=14, x=91, x=118, X=59, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-85, x=118, x=14, X=59, x=91, Y=7, y=2, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-85, x=98, x=14, x=118, X=59, Y=7, y=2, y++=216] [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=-85, x=14, X=59, x=118, x=98, Y=7, y=2, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=15, v=-71, x=118, x=98, x=15, X=59, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-71, x=98, x=118, X=59, x=15, Y=7, y=2, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-71, X=59, x=15, x=105, x=118, y=2, Y=7, y++=216] [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=-71, x=105, X=59, x=118, x=15, Y=7, y=2, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=16, v=-57, x=105, x=16, x=118, X=59, Y=7, y=2, y++=216] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-57, x=105, x=16, X=59, x=118, y=2, Y=7, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-57, X=59, x=112, x=118, x=16, y=2, Y=7, y++=216] [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=-57, x=112, x=16, X=59, x=118, Y=7, y=2, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=17, v=-43, x=118, X=59, x=17, x=112, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-43, x=112, X=59, x=17, x=118, y=2, Y=7, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-43, x=119, X=59, x=17, x=118, Y=7, y=2, y++=216] [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=-43, x=119, x=17, x=118, X=59, Y=7, y=2, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=18, v=-29, x=119, x=118, X=59, x=18, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-29, x=18, x=119, x=118, X=59, y=2, Y=7, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-29, x=18, x=126, x=118, X=59, Y=7, y=2, y++=216] [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=-29, X=59, x=118, x=126, x=18, y=2, Y=7, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=19, v=-15, X=59, x=126, x=118, x=19, Y=7, y=2, y++=216] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-15, x=19, x=126, x=118, X=59, Y=7, y=2, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-15, X=59, x=19, x=133, x=118, y=2, Y=7, y++=216] [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=-15, x=118, x=133, X=59, x=19, y=2, Y=7, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=20, v=-1, x=20, x=133, X=59, x=118, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-1, x=118, x=20, x=133, X=59, Y=7, y=2, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-1, x=140, x=20, x=118, X=59, y=2, Y=7, y++=216] [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=-1, X=59, x=20, x=140, x=118, y=2, Y=7, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=21, v=13, x=118, X=59, x=140, x=21, y=2, Y=7, y++=216] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=13, x=118, x=21, X=59, x=140, Y=7, y=2, y++=216] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=13, x=147, x=21, x=118, X=59, y=2, Y=7, y++=216] [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=13, x=147, X=59, x=118, x=21, Y=7, y=2, y++=216] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=22, v=-91, x=118, x=147, x=22, X=59, Y=7, y=3, y++=292] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-91, x=147, X=59, x=118, x=22, Y=7, y=3, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-91, X=59, x=177, x=22, x=154, Y=7, y=3, y++=292] [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=-91, x=22, X=59, x=177, x=154, Y=7, y=3, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=23, v=-77, x=23, x=177, X=59, x=154, y=3, Y=7, y++=292] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-77, x=154, x=177, x=23, X=59, Y=7, y=3, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-77, x=161, x=177, x=23, X=59, y=3, Y=7, y++=292] [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=-77, x=161, x=23, X=59, x=177, y=3, Y=7, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=24, v=-63, x=24, X=59, x=177, x=161, y=3, Y=7, y++=292] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-63, x=177, x=161, X=59, x=24, Y=7, y=3, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-63, x=24, x=168, X=59, x=177, y=3, Y=7, y++=292] [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=-63, X=59, x=168, x=24, x=177, y=3, Y=7, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=25, v=-49, x=168, x=177, X=59, x=25, y=3, Y=7, y++=292] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-49, X=59, x=25, x=177, x=168, y=3, Y=7, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-49, x=177, x=175, X=59, x=25, y=3, Y=7, y++=292] [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=-49, x=175, x=25, X=59, x=177, y=3, Y=7, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=26, v=-35, x=26, x=177, X=59, x=175, Y=7, y=3, y++=292] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-35, X=59, x=26, x=175, x=177, y=3, Y=7, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-35, x=182, X=59, x=26, x=177, y=3, Y=7, y++=292] [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=-35, x=26, x=182, X=59, x=177, y=3, Y=7, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=27, v=-21, x=27, x=177, x=182, X=59, Y=7, y=3, y++=292] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-21, x=27, x=177, X=59, x=182, Y=7, y=3, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-21, X=59, x=27, x=189, x=177, y=3, Y=7, y++=292] [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=-21, x=27, X=59, x=177, x=189, y=3, Y=7, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=28, v=-7, X=59, x=28, x=189, x=177, Y=7, y=3, y++=292] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-7, x=28, x=177, x=189, X=59, Y=7, y=3, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-7, x=177, X=59, x=196, x=28, Y=7, y=3, y++=292] [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=-7, X=59, x=28, x=177, x=196, y=3, Y=7, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=29, v=7, x=177, x=196, X=59, x=29, y=3, Y=7, y++=292] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=7, x=177, X=59, x=29, x=196, Y=7, y=3, y++=292] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=7, X=59, x=177, x=29, x=203, Y=7, y=3, y++=292] [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=7, x=177, x=203, X=59, x=29, Y=7, y=3, y++=292] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=30, v=-97, X=59, x=177, x=30, x=203, Y=7, y=4, y++=367] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-97, x=30, x=203, X=59, x=177, y=4, Y=7, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-97, x=30, X=59, x=236, x=210, y=4, Y=7, y++=367] [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=-97, x=210, x=30, x=236, X=59, Y=7, y=4, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=31, v=-83, x=31, x=210, x=236, X=59, y=4, Y=7, y++=367] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-83, X=59, x=236, x=210, x=31, y=4, Y=7, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-83, x=236, X=59, x=217, x=31, Y=7, y=4, y++=367] [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=-83, x=236, X=59, x=217, x=31, y=4, Y=7, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=32, v=-69, X=59, x=236, x=217, x=32, y=4, Y=7, y++=367] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-69, x=217, x=236, x=32, X=59, Y=7, y=4, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-69, x=224, x=236, X=59, x=32, Y=7, y=4, y++=367] [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=-69, x=236, x=32, X=59, x=224, Y=7, y=4, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=33, v=-55, x=33, x=224, X=59, x=236, y=4, Y=7, y++=367] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-55, x=236, X=59, x=224, x=33, y=4, Y=7, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-55, x=33, X=59, x=236, x=231, y=4, Y=7, y++=367] [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=-55, x=231, x=33, X=59, x=236, Y=7, y=4, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=34, v=-41, x=34, x=236, x=231, X=59, Y=7, y=4, y++=367] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-41, x=34, x=236, X=59, x=231, Y=7, y=4, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-41, x=236, x=238, X=59, x=34, Y=7, y=4, y++=367] [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=-41, x=34, x=236, x=238, X=59, y=4, Y=7, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=35, v=-27, x=35, X=59, x=236, x=238, y=4, Y=7, y++=367] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-27, x=238, X=59, x=236, x=35, y=4, Y=7, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-27, x=245, x=236, X=59, x=35, Y=7, y=4, y++=367] [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=-27, X=59, x=236, x=35, x=245, Y=7, y=4, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=36, v=-13, x=36, X=59, x=245, x=236, Y=7, y=4, y++=367] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-13, x=36, x=236, x=245, X=59, y=4, Y=7, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-13, x=252, X=59, x=36, x=236, Y=7, y=4, y++=367] [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=-13, X=59, x=252, x=236, x=36, y=4, Y=7, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=37, v=1, X=59, x=37, x=236, x=252, y=4, Y=7, y++=367] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=1, x=37, x=236, x=252, X=59, Y=7, y=4, y++=367] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=1, x=37, x=259, X=59, x=236, y=4, Y=7, y++=367] [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=1, x=236, x=37, X=59, x=259, y=4, Y=7, y++=367] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=38, v=-103, X=59, x=236, x=38, x=259, Y=7, y=5, y++=424] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-103, x=236, X=59, x=38, x=259, Y=7, y=5, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-103, x=295, x=38, X=59, x=266, Y=7, y=5, y++=424] [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=-103, X=59, x=266, x=38, x=295, Y=7, y=5, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=39, v=-89, X=59, x=295, x=39, x=266, Y=7, y=5, y++=424] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-89, x=266, x=39, X=59, x=295, Y=7, y=5, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-89, x=273, X=59, x=295, x=39, Y=7, y=5, y++=424] [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=-89, x=295, x=39, x=273, X=59, y=5, Y=7, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=40, v=-75, x=295, x=40, x=273, X=59, Y=7, y=5, y++=424] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-75, x=295, X=59, x=40, x=273, Y=7, y=5, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-75, x=295, x=280, x=40, X=59, Y=7, y=5, y++=424] [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=-75, X=59, x=295, x=40, x=280, Y=7, y=5, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=41, v=-61, x=280, X=59, x=295, x=41, y=5, Y=7, y++=424] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-61, X=59, x=295, x=280, x=41, y=5, Y=7, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-61, x=41, x=287, x=295, X=59, Y=7, y=5, y++=424] [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=-61, X=59, x=41, x=295, x=287, y=5, Y=7, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=42, v=-47, x=42, x=295, x=287, X=59, y=5, Y=7, y++=424] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-47, x=287, x=42, X=59, x=295, Y=7, y=5, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-47, x=42, x=294, x=295, X=59, Y=7, y=5, y++=424] [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=-47, x=42, x=294, X=59, x=295, y=5, Y=7, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=43, v=-33, x=295, x=43, X=59, x=294, y=5, Y=7, y++=424] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-33, x=295, x=43, X=59, x=294, Y=7, y=5, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-33, x=301, x=295, x=43, X=59, y=5, Y=7, y++=424] [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=-33, x=43, x=301, x=295, X=59, y=5, Y=7, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=44, v=-19, x=295, x=301, X=59, x=44, Y=7, y=5, y++=424] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-19, x=44, x=301, x=295, X=59, y=5, Y=7, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-19, x=308, x=44, x=295, X=59, y=5, Y=7, y++=424] [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=-19, x=44, x=295, X=59, x=308, y=5, Y=7, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=45, v=-5, x=308, X=59, x=295, x=45, Y=7, y=5, y++=424] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-5, x=295, x=308, x=45, X=59, y=5, Y=7, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-5, X=59, x=295, x=45, x=315, Y=7, y=5, y++=424] [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=-5, x=45, x=315, X=59, x=295, Y=7, y=5, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=46, v=9, x=295, x=46, x=315, X=59, Y=7, y=5, y++=424] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=9, x=315, x=46, x=295, X=59, Y=7, y=5, y++=424] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=9, X=59, x=322, x=295, x=46, Y=7, y=5, y++=424] [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=322, x=46, x=295, X=59, Y=7, y=5, y++=424] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=47, v=-95, X=59, x=295, x=47, x=322, y=6, Y=7, y++=511] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-95, x=47, x=295, x=322, X=59, Y=7, y=6, y++=511] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-95, x=329, x=354, X=59, x=47, Y=7, y=6, y++=511] [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=-95, x=47, x=329, x=354, X=59, y=6, Y=7, y++=511] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=48, v=-81, x=354, X=59, x=329, x=48, y=6, Y=7, y++=511] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-81, x=48, x=329, x=354, X=59, Y=7, y=6, y++=511] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-81, x=48, X=59, x=336, x=354, y=6, Y=7, y++=511] [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=-81, x=336, x=354, x=48, X=59, Y=7, y=6, y++=511] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=49, v=-67, x=354, X=59, x=336, x=49, y=6, Y=7, y++=511] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=-67, x=336, x=49, X=59, x=354, Y=7, y=6, y++=511] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=-67, x=354, X=59, x=49, x=343, y=6, Y=7, y++=511] [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=-67, x=354, x=49, X=59, x=343, y=6, Y=7, y++=511] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=50, v=-53, x=354, X=59, x=50, x=343, Y=7, y=6, y++=511] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-53, x=354, X=59, x=343, x=50, Y=7, y=6, y++=511] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-53, x=50, x=350, X=59, x=300, Y=7, y=6, y++=511] [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, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.1s, OverallIterations: 9, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1053 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1053 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1315 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 204 mSDtfsCounter, 1315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2357 GetRequests, 1929 SyntacticMatches, 48 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7084 ImplicationChecksByTransitivity, 37.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=8, InterpolantAutomatonStates: 307, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 40.0s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 4386 SizeOfPredicates, 99 NumberOfNonLiveVariables, 2324 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 5624/21770 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:13:53,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9699f240-1396-470d-bc1e-062a2ca10376/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE