./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/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_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 03:13:58,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:13:58,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:13:58,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:13:58,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:13:58,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:13:58,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:13:58,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:13:58,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:13:58,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:13:58,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:13:58,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:13:58,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:13:58,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:13:58,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:13:58,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:13:58,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:13:58,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:13:58,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:13:58,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:13:58,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:13:58,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:13:58,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:13:58,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:13:58,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:13:58,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:13:58,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:13:58,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:13:58,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:13:58,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:13:58,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:13:58,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:13:58,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:13:58,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:13:58,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:13:58,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:13:58,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:13:58,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:13:58,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:13:58,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:13:58,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:13:58,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 03:13:58,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:13:58,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:13:58,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:13:58,943 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:13:58,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:13:58,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:13:58,944 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:13:58,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:13:58,945 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:13:58,945 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:13:58,945 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:13:58,945 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:13:58,946 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:13:58,946 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:13:58,946 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:13:58,946 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:13:58,946 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:13:58,947 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:13:58,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:13:58,947 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:13:58,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:13:58,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:13:58,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:13:58,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:13:58,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:13:58,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:13:58,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:13:58,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:13:58,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:13:58,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:13:58,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:13:58,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:13:58,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:13:58,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:13:58,950 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:13:58,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:13:58,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:13:58,951 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:13:58,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:13:58,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:13:58,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:13:58,951 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_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/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_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh 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-12-14 03:13:59,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:13:59,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:13:59,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:13:59,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:13:59,173 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:13:59,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-12-14 03:14:01,820 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:14:01,987 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:14:01,988 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-12-14 03:14:01,994 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/data/9e2083408/b6fc9d0b364741ccb5db3c7310fe8058/FLAG616d249f4 [2022-12-14 03:14:02,007 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/data/9e2083408/b6fc9d0b364741ccb5db3c7310fe8058 [2022-12-14 03:14:02,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:14:02,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:14:02,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:14:02,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:14:02,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:14:02,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6f67aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02, skipping insertion in model container [2022-12-14 03:14:02,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:14:02,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:14:02,144 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-12-14 03:14:02,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:14:02,165 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:14:02,174 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-12-14 03:14:02,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:14:02,188 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:14:02,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02 WrapperNode [2022-12-14 03:14:02,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:14:02,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:14:02,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:14:02,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:14:02,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,211 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-12-14 03:14:02,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:14:02,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:14:02,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:14:02,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:14:02,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,224 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:14:02,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:14:02,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:14:02,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:14:02,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (1/1) ... [2022-12-14 03:14:02,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:14:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:02,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:14:02,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:14:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:14:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:14:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:14:02,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:14:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 03:14:02,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 03:14:02,348 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:14:02,350 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:14:02,449 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:14:02,478 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:14:02,478 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 03:14:02,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:14:02 BoogieIcfgContainer [2022-12-14 03:14:02,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:14:02,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:14:02,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:14:02,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:14:02,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:14:02" (1/3) ... [2022-12-14 03:14:02,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e13f86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:14:02, skipping insertion in model container [2022-12-14 03:14:02,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:14:02" (2/3) ... [2022-12-14 03:14:02,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e13f86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:14:02, skipping insertion in model container [2022-12-14 03:14:02,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:14:02" (3/3) ... [2022-12-14 03:14:02,488 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-12-14 03:14:02,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:14:02,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 03:14:02,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:14:02,542 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;@478c4ad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:14:02,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 03:14:02,545 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-12-14 03:14:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 03:14:02,550 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:02,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:02,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-12-14 03:14:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:02,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537827688] [2022-12-14 03:14:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:02,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:02,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575255164] [2022-12-14 03:14:02,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:02,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:02,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 03:14:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:14:02,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 03:14:02,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:02,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:14:02,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:02,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537827688] [2022-12-14 03:14:02,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:02,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575255164] [2022-12-14 03:14:02,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575255164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:14:02,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:14:02,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:14:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678795318] [2022-12-14 03:14:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:14:02,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:14:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:02,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:14:02,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:14:02,860 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-12-14 03:14:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:02,965 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-12-14 03:14:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:14:02,967 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-12-14 03:14:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:02,974 INFO L225 Difference]: With dead ends: 42 [2022-12-14 03:14:02,974 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 03:14:02,977 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-12-14 03:14:02,981 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 03:14:02,982 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-12-14 03:14:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 03:14:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-14 03:14:03,014 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-12-14 03:14:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-12-14 03:14:03,016 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-12-14 03:14:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:03,017 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-12-14 03:14:03,017 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-12-14 03:14:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-12-14 03:14:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 03:14:03,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:03,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:03,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:14:03,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-14 03:14:03,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:03,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-12-14 03:14:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:03,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893925405] [2022-12-14 03:14:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:03,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:03,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16708485] [2022-12-14 03:14:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:03,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:03,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:03,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:03,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 03:14:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:14:03,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 03:14:03,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:03,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:04,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893925405] [2022-12-14 03:14:04,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16708485] [2022-12-14 03:14:04,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16708485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:04,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [604641604] [2022-12-14 03:14:04,107 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 03:14:04,108 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:04,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:04,116 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:04,117 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:04,581 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-12-14 03:14:04,622 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:14:07,406 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '230#(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-12-14 03:14:07,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:14:07,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:14:07,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-12-14 03:14:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054482140] [2022-12-14 03:14:07,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:14:07,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 03:14:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 03:14:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2022-12-14 03:14:07,409 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 03:14:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:07,745 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-12-14 03:14:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 03:14:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-12-14 03:14:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:07,747 INFO L225 Difference]: With dead ends: 35 [2022-12-14 03:14:07,747 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 03:14:07,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=122, Invalid=633, Unknown=1, NotChecked=0, Total=756 [2022-12-14 03:14:07,750 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:14:07,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 34 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:14:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 03:14:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-12-14 03:14:07,759 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-12-14 03:14:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-12-14 03:14:07,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-12-14 03:14:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:07,760 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-12-14 03:14:07,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 03:14:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-12-14 03:14:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 03:14:07,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:07,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:07,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 03:14:07,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-14 03:14:07,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-12-14 03:14:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266196040] [2022-12-14 03:14:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:07,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:07,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108890788] [2022-12-14 03:14:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:07,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:07,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:07,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:07,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 03:14:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:14:08,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 03:14:08,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:08,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:08,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:08,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266196040] [2022-12-14 03:14:08,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:08,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108890788] [2022-12-14 03:14:08,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108890788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:08,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [413793260] [2022-12-14 03:14:08,148 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 03:14:08,148 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:08,148 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:08,148 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:08,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:08,452 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 03:14:08,549 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:14:09,176 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '423#(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-12-14 03:14:09,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:14:09,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:14:09,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-12-14 03:14:09,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623283647] [2022-12-14 03:14:09,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:14:09,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 03:14:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 03:14:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-14 03:14:09,178 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-12-14 03:14:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:09,263 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-12-14 03:14:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:14:09,263 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-12-14 03:14:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:09,264 INFO L225 Difference]: With dead ends: 59 [2022-12-14 03:14:09,264 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 03:14:09,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-12-14 03:14:09,266 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:14:09,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 68 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 03:14:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 03:14:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-12-14 03:14:09,277 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-12-14 03:14:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-12-14 03:14:09,278 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-12-14 03:14:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:09,278 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-12-14 03:14:09,278 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-12-14 03:14:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-12-14 03:14:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 03:14:09,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:09,279 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:09,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 03:14:09,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:09,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-12-14 03:14:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:09,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41579846] [2022-12-14 03:14:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:09,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:09,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4900297] [2022-12-14 03:14:09,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:09,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:09,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:09,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:09,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 03:14:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:14:09,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 03:14:09,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:14:09,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:14:10,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:10,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41579846] [2022-12-14 03:14:10,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:10,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4900297] [2022-12-14 03:14:10,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4900297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:10,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [240616605] [2022-12-14 03:14:10,256 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 03:14:10,256 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:10,256 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:10,256 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:10,257 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:10,585 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-12-14 03:14:10,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:14:14,380 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '720#(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-12-14 03:14:14,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:14:14,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:14:14,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2022-12-14 03:14:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007083908] [2022-12-14 03:14:14,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:14:14,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 03:14:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 03:14:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-12-14 03:14:14,382 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 03:14:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:14,893 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-12-14 03:14:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 03:14:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2022-12-14 03:14:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:14,894 INFO L225 Difference]: With dead ends: 49 [2022-12-14 03:14:14,894 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 03:14:14,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 03:14:14,895 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:14:14,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 58 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:14:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 03:14:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-12-14 03:14:14,905 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-12-14 03:14:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-12-14 03:14:14,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-12-14 03:14:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:14,906 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-12-14 03:14:14,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 03:14:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-12-14 03:14:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 03:14:14,907 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:14,907 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:14,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 03:14:15,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:15,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-12-14 03:14:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102467588] [2022-12-14 03:14:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:15,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:15,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992490735] [2022-12-14 03:14:15,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:14:15,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:15,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:15,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 03:14:15,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 03:14:15,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:14:15,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 03:14:15,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:15,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 03:14:15,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102467588] [2022-12-14 03:14:15,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992490735] [2022-12-14 03:14:15,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992490735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:15,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715485186] [2022-12-14 03:14:15,326 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 03:14:15,326 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:15,326 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:15,326 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:15,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:15,614 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 03:14:15,713 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:14:32,722 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 84 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 03:14:35,079 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1119#(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-12-14 03:14:35,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:14:35,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:14:35,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-12-14 03:14:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105242953] [2022-12-14 03:14:35,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:14:35,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 03:14:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 03:14:35,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=447, Unknown=3, NotChecked=0, Total=552 [2022-12-14 03:14:35,082 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-12-14 03:14:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:35,350 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-12-14 03:14:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 03:14:35,351 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-12-14 03:14:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:35,351 INFO L225 Difference]: With dead ends: 95 [2022-12-14 03:14:35,351 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 03:14:35,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=215, Invalid=838, Unknown=3, NotChecked=0, Total=1056 [2022-12-14 03:14:35,352 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:14:35,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 92 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:14:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 03:14:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-14 03:14:35,367 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-12-14 03:14:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-12-14 03:14:35,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-12-14 03:14:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:35,368 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-12-14 03:14:35,368 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-12-14 03:14:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-12-14 03:14:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 03:14:35,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:35,369 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:35,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 03:14:35,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:35,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-12-14 03:14:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:35,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710943089] [2022-12-14 03:14:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:35,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:35,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870222927] [2022-12-14 03:14:35,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 03:14:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:35,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:35,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:35,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 03:14:35,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 03:14:35,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:14:35,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 03:14:35,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:35,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-12-14 03:14:36,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710943089] [2022-12-14 03:14:36,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870222927] [2022-12-14 03:14:36,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870222927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:36,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1175765263] [2022-12-14 03:14:36,208 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 03:14:36,208 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:36,208 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:36,208 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:36,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:36,459 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 03:14:36,532 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:14:37,587 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1947#(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-12-14 03:14:37,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:14:37,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:14:37,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-12-14 03:14:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219132337] [2022-12-14 03:14:37,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:14:37,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 03:14:37,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 03:14:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 03:14:37,591 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-12-14 03:14:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:38,163 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-12-14 03:14:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-14 03:14:38,164 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-12-14 03:14:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:38,165 INFO L225 Difference]: With dead ends: 191 [2022-12-14 03:14:38,165 INFO L226 Difference]: Without dead ends: 185 [2022-12-14 03:14:38,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 03:14:38,166 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:14:38,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 182 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:14:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-14 03:14:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-12-14 03:14:38,195 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-12-14 03:14:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-12-14 03:14:38,196 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-12-14 03:14:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:38,196 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-12-14 03:14:38,197 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-12-14 03:14:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-12-14 03:14:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 03:14:38,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:38,198 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:38,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 03:14:38,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:38,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-12-14 03:14:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:38,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211957531] [2022-12-14 03:14:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:38,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:38,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:38,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015145862] [2022-12-14 03:14:38,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 03:14:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:38,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:38,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 03:14:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:14:38,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 03:14:38,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:39,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-12-14 03:14:39,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211957531] [2022-12-14 03:14:39,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015145862] [2022-12-14 03:14:39,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015145862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:39,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778835149] [2022-12-14 03:14:39,919 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 03:14:39,919 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:39,919 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:39,920 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:39,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:40,183 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 03:14:40,272 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:14:48,901 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3663#(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-12-14 03:14:48,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:14:48,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:14:48,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-12-14 03:14:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251988786] [2022-12-14 03:14:48,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:14:48,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 03:14:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:14:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 03:14:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1164, Invalid=2374, Unknown=2, NotChecked=0, Total=3540 [2022-12-14 03:14:48,904 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-12-14 03:14:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:14:51,372 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-12-14 03:14:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-12-14 03:14:51,373 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-12-14 03:14:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:14:51,376 INFO L225 Difference]: With dead ends: 383 [2022-12-14 03:14:51,376 INFO L226 Difference]: Without dead ends: 377 [2022-12-14 03:14:51,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3347, Invalid=7571, Unknown=2, NotChecked=0, Total=10920 [2022-12-14 03:14:51,378 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 203 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:14:51,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 278 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:14:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-12-14 03:14:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-12-14 03:14:51,431 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-12-14 03:14:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-12-14 03:14:51,432 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-12-14 03:14:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:14:51,432 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-12-14 03:14:51,432 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-12-14 03:14:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-12-14 03:14:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-12-14 03:14:51,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:14:51,440 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-12-14 03:14:51,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 03:14:51,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 03:14:51,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:14:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:14:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-12-14 03:14:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:14:51,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476848486] [2022-12-14 03:14:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:14:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:14:51,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:14:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342477036] [2022-12-14 03:14:51,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:14:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:14:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:14:51,696 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:14:51,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 03:14:53,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-12-14 03:14:53,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:14:53,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-14 03:14:53,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:14:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:14:55,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:14:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-12-14 03:14:57,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:14:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476848486] [2022-12-14 03:14:57,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 03:14:57,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342477036] [2022-12-14 03:14:57,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342477036] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:14:57,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948038254] [2022-12-14 03:14:57,561 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 03:14:57,561 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 03:14:57,561 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 03:14:57,561 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 03:14:57,561 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 03:14:57,810 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-12-14 03:14:57,897 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 03:15:14,539 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7111#(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-12-14 03:15:14,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 03:15:14,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 03:15:14,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-12-14 03:15:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72125463] [2022-12-14 03:15:14,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:14,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 03:15:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 03:15:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=2668, Unknown=1, NotChecked=0, Total=4032 [2022-12-14 03:15:14,543 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-12-14 03:15:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:17,243 INFO L93 Difference]: Finished difference Result 415 states and 418 transitions. [2022-12-14 03:15:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-14 03:15:17,244 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-12-14 03:15:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:17,246 INFO L225 Difference]: With dead ends: 415 [2022-12-14 03:15:17,247 INFO L226 Difference]: Without dead ends: 409 [2022-12-14 03:15:17,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1175 GetRequests, 1020 SyntacticMatches, 44 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3235 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=3958, Invalid=8697, Unknown=1, NotChecked=0, Total=12656 [2022-12-14 03:15:17,249 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:17,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 380 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:15:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-12-14 03:15:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-12-14 03:15:17,315 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-12-14 03:15:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2022-12-14 03:15:17,316 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 376 [2022-12-14 03:15:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:17,317 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2022-12-14 03:15:17,317 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-12-14 03:15:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2022-12-14 03:15:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-12-14 03:15:17,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:17,324 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:17,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 03:15:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:17,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 03:15:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash -138579467, now seen corresponding path program 6 times [2022-12-14 03:15:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:17,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677728981] [2022-12-14 03:15:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:17,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 03:15:17,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058425981] [2022-12-14 03:15:17,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 03:15:17,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:17,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:17,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:17,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 03:15:18,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 03:15:18,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-14 03:15:18,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 03:15:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 03:15:20,021 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 03:15:20,021 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 03:15:20,022 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 03:15:20,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 03:15:20,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:20,234 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-12-14 03:15:20,247 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 03:15:20,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:15:20 BoogieIcfgContainer [2022-12-14 03:15:20,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 03:15:20,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 03:15:20,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 03:15:20,388 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 03:15:20,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:14:02" (3/4) ... [2022-12-14 03:15:20,390 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 03:15:20,493 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 03:15:20,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 03:15:20,494 INFO L158 Benchmark]: Toolchain (without parser) took 78483.30ms. Allocated memory was 111.1MB in the beginning and 157.3MB in the end (delta: 46.1MB). Free memory was 66.1MB in the beginning and 53.4MB in the end (delta: 12.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-12-14 03:15:20,494 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory was 83.1MB in the beginning and 83.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 03:15:20,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.60ms. Allocated memory is still 111.1MB. Free memory was 65.8MB in the beginning and 55.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 03:15:20,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.76ms. Allocated memory is still 111.1MB. Free memory was 55.4MB in the beginning and 54.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 03:15:20,495 INFO L158 Benchmark]: Boogie Preprocessor took 13.72ms. Allocated memory is still 111.1MB. Free memory was 54.0MB in the beginning and 52.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 03:15:20,495 INFO L158 Benchmark]: RCFGBuilder took 253.39ms. Allocated memory was 111.1MB in the beginning and 157.3MB in the end (delta: 46.1MB). Free memory was 52.9MB in the beginning and 127.8MB in the end (delta: -74.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-12-14 03:15:20,496 INFO L158 Benchmark]: TraceAbstraction took 77905.89ms. Allocated memory is still 157.3MB. Free memory was 127.3MB in the beginning and 72.5MB in the end (delta: 54.7MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2022-12-14 03:15:20,496 INFO L158 Benchmark]: Witness Printer took 105.39ms. Allocated memory is still 157.3MB. Free memory was 72.5MB in the beginning and 53.4MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 03:15:20,497 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.11ms. Allocated memory is still 111.1MB. Free memory was 83.1MB in the beginning and 83.0MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.60ms. Allocated memory is still 111.1MB. Free memory was 65.8MB in the beginning and 55.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.76ms. Allocated memory is still 111.1MB. Free memory was 55.4MB in the beginning and 54.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.72ms. Allocated memory is still 111.1MB. Free memory was 54.0MB in the beginning and 52.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 253.39ms. Allocated memory was 111.1MB in the beginning and 157.3MB in the end (delta: 46.1MB). Free memory was 52.9MB in the beginning and 127.8MB in the end (delta: -74.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 77905.89ms. Allocated memory is still 157.3MB. Free memory was 127.3MB in the beginning and 72.5MB in the end (delta: 54.7MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 105.39ms. Allocated memory is still 157.3MB. Free memory was 72.5MB in the beginning and 53.4MB in the end (delta: 19.1MB). 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=76, X=90, x=0, y=0, Y=83] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=76, x=0, X=90, y=0, Y=83] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=76, X=90, x=0, x=0, x=0, y=0, Y=83] [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=76, x=0, X=90, x=0, x=0, Y=83, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=1, v=62, X=90, x=1, x=0, x=0, y=1, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=62, x=0, x=0, x=1, X=90, Y=83, y=1, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=62, x=90, X=90, x=83, x=1, Y=83, y=1, y++=0] [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=62, x=1, x=90, x=83, X=90, y=1, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=2, v=48, x=83, x=90, x=2, X=90, y=2, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=48, x=83, x=90, x=2, X=90, y=2, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=48, X=90, x=180, x=166, x=2, Y=83, y=2, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=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=48, x=180, x=2, X=90, x=166, y=2, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=3, v=34, x=3, x=180, X=90, x=166, Y=83, y=3, y++=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=34, x=3, x=166, X=90, x=180, y=3, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=34, x=249, x=3, X=90, x=270, Y=83, y=3, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=34, X=90, x=249, x=3, x=270, Y=83, y=3, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=4, v=20, x=270, X=90, x=249, x=4, y=4, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=20, X=90, x=249, x=4, x=270, y=4, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=20, x=4, X=90, x=332, x=360, y=4, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=20, x=4, x=332, x=360, X=90, Y=83, y=4, y++=0] [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=6, X=90, x=360, x=332, x=5, Y=83, y=5, y++=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=6, x=360, x=5, X=90, x=332, y=5, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=6, X=90, x=5, x=415, x=450, y=5, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=6, x=415, x=5, X=90, x=450, y=5, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=6, v=-8, x=450, x=6, x=415, X=90, y=6, Y=83, y++=171] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-8, x=450, x=6, X=90, x=415, y=6, Y=83, y++=171] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-8, x=540, x=6, x=498, X=90, Y=83, y=6, y++=171] [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=-8, x=498, x=6, X=90, x=540, Y=83, y=6, y++=171] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=7, v=158, x=498, x=7, x=540, X=90, Y=83, y=6, y++=171] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=158, x=498, x=540, x=7, X=90, Y=83, y=6, y++=171] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=158, x=581, X=90, x=540, x=7, y=6, Y=83, y++=171] [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=158, x=7, X=90, x=540, x=581, y=6, Y=83, y++=171] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=8, v=144, x=540, X=90, x=581, x=8, y=7, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=144, x=581, X=90, x=540, x=8, y=7, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=144, x=630, x=664, X=90, x=8, Y=83, y=7, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=144, x=8, X=90, x=630, x=664, Y=83, y=7, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=9, v=130, x=9, x=630, x=664, X=90, y=8, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=130, X=90, x=664, x=9, x=630, Y=83, y=8, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=130, x=747, x=9, x=720, X=90, y=8, Y=83, y++=0] [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=130, x=9, x=720, x=747, X=90, y=8, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=10, v=116, x=747, X=90, x=10, x=720, y=9, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=116, x=720, x=747, X=90, x=10, y=9, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=116, x=830, x=810, X=90, x=10, Y=83, y=9, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=116, x=810, X=90, x=830, x=10, Y=83, y=9, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=11, v=102, x=11, X=90, x=830, x=810, y=10, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=102, x=11, x=810, X=90, x=830, y=10, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=102, x=913, x=11, X=90, x=900, y=10, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=102, x=900, X=90, x=913, x=11, y=10, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=12, v=88, x=913, x=900, x=12, X=90, Y=83, y=11, y++=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=88, x=900, X=90, x=12, x=913, Y=83, y=11, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=88, x=996, X=90, x=990, x=12, Y=83, y=11, y++=0] [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=88, X=90, x=12, x=990, x=996, y=11, Y=83, y++=0] [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=74, x=996, X=90, x=13, x=990, y=12, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=74, x=996, x=13, x=990, X=90, y=12, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=74, x=13, X=90, x=1079, x=1080, y=12, Y=83, y++=0] [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=74, X=90, x=1079, x=13, x=1080, y=12, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=14, v=60, x=1080, x=1079, x=14, X=90, Y=83, y=13, y++=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=60, x=1079, X=90, x=1080, x=14, Y=83, y=13, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=60, x=14, x=1170, X=90, x=1162, Y=83, y=13, y++=0] [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=60, x=1170, x=14, x=1162, X=90, Y=83, y=13, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=15, v=46, X=90, x=1162, x=15, x=1170, Y=83, y=14, y++=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=46, X=90, x=1162, x=15, x=1170, Y=83, y=14, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=46, X=90, x=15, x=1260, x=1245, Y=83, y=14, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=46, x=15, x=1260, X=90, x=1245, y=14, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=16, v=32, X=90, x=1260, x=16, x=1245, y=15, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=32, x=1245, x=16, x=1260, X=90, Y=83, y=15, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=32, x=16, x=1328, x=1350, X=90, y=15, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=32, x=1350, X=90, x=16, x=1328, Y=83, y=15, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=17, v=18, X=90, x=1328, x=1350, x=17, Y=83, y=16, y++=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=18, x=17, X=90, x=1350, x=1328, y=16, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=18, X=90, x=1411, x=1440, x=17, y=16, Y=83, y++=0] [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=18, x=1440, x=1411, X=90, x=17, Y=83, y=16, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=18, v=4, x=18, X=90, x=1440, x=1411, y=17, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=4, x=1411, x=1440, x=18, X=90, Y=83, y=17, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=4, x=18, x=1530, x=1494, X=90, y=17, Y=83, y++=0] [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=4, x=18, X=90, x=1530, x=1494, Y=83, y=17, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=19, v=-10, x=19, X=90, x=1494, x=1530, Y=83, y=18, y++=277] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-10, x=1494, x=19, X=90, x=1530, y=18, Y=83, y++=277] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-10, x=1577, x=1620, x=19, X=90, y=18, Y=83, y++=277] [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=-10, X=90, x=1620, x=1577, x=19, Y=83, y=18, y++=277] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=20, v=156, x=20, x=1620, X=90, x=1577, y=18, Y=83, y++=277] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=156, x=1577, x=1620, x=20, X=90, y=18, Y=83, y++=277] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=156, x=1620, x=20, X=90, x=1660, Y=83, y=18, y++=277] [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=156, x=20, x=1660, x=1620, X=90, y=18, Y=83, y++=277] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=21, v=142, x=1620, X=90, x=1660, x=21, y=19, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=142, x=1660, X=90, x=1620, x=21, y=19, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=142, x=1710, x=1743, x=21, X=90, y=19, Y=83, y++=0] [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=142, x=1743, x=1710, x=21, X=90, Y=83, y=19, y++=0] [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=128, x=1743, X=90, x=1710, x=22, Y=83, y=20, y++=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=128, x=1743, x=1710, X=90, x=22, Y=83, y=20, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=128, X=90, x=1826, x=22, x=1800, Y=83, y=20, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=128, x=22, X=90, x=1826, x=1800, y=20, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=23, v=114, x=1826, x=23, x=1800, X=90, Y=83, y=21, y++=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=114, X=90, x=23, x=1826, x=1800, y=21, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=114, x=1909, x=23, X=90, x=1890, y=21, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=114, x=23, x=1890, X=90, x=1909, Y=83, y=21, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=24, v=100, X=90, x=1890, x=1909, x=24, y=22, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=100, x=24, X=90, x=1890, x=1909, y=22, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=100, x=1980, X=90, x=24, x=1992, y=22, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=100, x=24, x=1980, x=1992, X=90, y=22, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=25, v=86, x=1980, x=25, x=1992, X=90, Y=83, y=23, y++=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=86, x=1992, x=1980, x=25, X=90, y=23, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=86, x=2075, X=90, x=2070, x=25, Y=83, y=23, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=86, x=2075, X=90, x=25, x=2070, Y=83, y=23, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=26, v=72, X=90, x=26, x=2075, x=2070, y=24, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=72, x=2075, X=90, x=2070, x=26, Y=83, y=24, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=72, X=90, x=2158, x=26, x=2160, Y=83, y=24, y++=0] [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=72, x=26, x=2160, X=90, x=2158, Y=83, y=24, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=27, v=58, x=2160, x=2158, x=27, X=90, Y=83, y=25, y++=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=58, x=27, x=2160, x=2158, X=90, Y=83, y=25, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=58, X=90, x=2241, x=2250, x=27, y=25, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=58, x=27, x=2241, x=2250, X=90, Y=83, y=25, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=28, v=44, x=28, x=2250, x=2241, X=90, Y=83, y=26, y++=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=44, x=2241, x=2250, X=90, x=28, y=26, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=44, x=28, X=90, x=2340, x=2324, Y=83, y=26, y++=0] [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=44, x=2324, x=2340, x=28, X=90, Y=83, y=26, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=29, v=30, X=90, x=29, x=2340, x=2324, Y=83, y=27, y++=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=30, x=2340, x=2324, X=90, x=29, y=27, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=30, x=2430, X=90, x=29, x=2407, y=27, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=30, x=29, x=2407, X=90, x=2430, y=27, Y=83, y++=0] [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=16, x=2407, X=90, x=30, x=2430, y=28, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=16, x=30, x=2430, x=2407, X=90, Y=83, y=28, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=16, x=2490, X=90, x=2520, x=30, y=28, Y=83, y++=0] [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=16, x=2490, x=2520, X=90, x=30, y=28, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=31, v=2, x=2490, X=90, x=31, x=2520, Y=83, y=29, y++=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=2, x=2490, x=2520, X=90, x=31, Y=83, y=29, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=2, x=2573, x=2610, x=31, X=90, Y=83, y=29, y++=0] [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=2, x=2573, x=31, x=2610, X=90, y=29, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=32, v=-12, X=90, x=2573, x=2610, x=32, Y=83, y=30, y++=385] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-12, X=90, x=32, x=2573, x=2610, Y=83, y=30, y++=385] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-12, X=90, x=32, x=2656, x=2700, Y=83, y=30, y++=385] [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=-12, x=2700, X=90, x=2656, x=32, y=30, Y=83, y++=385] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=33, v=154, x=2700, x=2656, x=33, X=90, Y=83, y=30, y++=385] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=154, x=2700, X=90, x=33, x=2656, y=30, Y=83, y++=385] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=154, x=33, X=90, x=2700, x=2739, Y=83, y=30, y++=385] [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=154, X=90, x=2700, x=2739, x=33, Y=83, y=30, y++=385] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=34, v=140, x=2739, X=90, x=34, x=2700, Y=83, y=31, y++=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=140, x=2700, x=34, x=2739, X=90, Y=83, y=31, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=140, X=90, x=2822, x=34, x=2790, Y=83, y=31, y++=0] [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=140, x=34, X=90, x=2790, x=2822, Y=83, y=31, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=35, v=126, x=35, X=90, x=2822, x=2790, Y=83, y=32, y++=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=126, X=90, x=2822, x=2790, x=35, y=32, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=126, x=35, X=90, x=2905, x=2880, Y=83, y=32, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=126, x=35, X=90, x=2905, x=2880, Y=83, y=32, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=36, v=112, x=2880, x=2905, X=90, x=36, y=33, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=112, X=90, x=2905, x=2880, x=36, y=33, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=112, x=2988, x=2970, x=36, X=90, Y=83, y=33, y++=0] [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=112, x=2970, x=36, x=2988, X=90, y=33, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=37, v=98, x=37, X=90, x=2970, x=2988, Y=83, y=34, y++=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=98, x=37, x=2970, X=90, x=2988, Y=83, y=34, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=98, x=37, X=90, x=3071, x=3060, y=34, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=98, x=37, x=3071, x=3060, X=90, y=34, Y=83, y++=0] [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=84, x=3060, x=3071, X=90, x=38, y=35, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=84, x=3071, X=90, x=3060, x=38, Y=83, y=35, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=84, X=90, x=38, x=3154, x=3150, y=35, Y=83, y++=0] [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=84, x=3150, x=38, x=3154, X=90, y=35, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=39, v=70, x=39, X=90, x=3154, x=3150, y=36, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=70, x=3150, X=90, x=3154, x=39, y=36, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=70, x=3237, X=90, x=39, x=3240, Y=83, y=36, y++=0] [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=70, x=3237, x=3240, x=39, X=90, y=36, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=40, v=56, X=90, x=3237, x=40, x=3240, y=37, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=56, x=3237, X=90, x=40, x=3240, Y=83, y=37, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=56, x=40, x=3320, x=3330, X=90, y=37, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=56, x=3330, X=90, x=3320, x=40, Y=83, y=37, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=41, v=42, X=90, x=3330, x=41, x=3320, Y=83, y=38, y++=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=42, x=41, x=3330, x=3320, X=90, Y=83, y=38, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=42, x=3420, x=41, x=3403, X=90, Y=83, y=38, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=42, x=3403, X=90, x=3420, x=41, Y=83, y=38, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=42, v=28, X=90, x=42, x=3403, x=3420, Y=83, y=39, y++=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=28, X=90, x=3403, x=3420, x=42, Y=83, y=39, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=28, X=90, x=3486, x=42, x=3510, Y=83, y=39, y++=0] [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=28, x=3486, x=42, x=3510, X=90, y=39, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=43, v=14, x=3486, x=43, x=3510, X=90, y=40, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=14, x=3486, x=43, x=3510, X=90, Y=83, y=40, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=14, x=3569, x=43, X=90, x=3600, y=40, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=14, x=3569, x=43, X=90, x=3600, Y=83, y=40, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=44, v=0, x=3600, X=90, x=44, x=3569, Y=83, y=41, y++=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=0, x=44, x=3600, X=90, x=3569, y=41, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=0, x=3652, x=44, X=90, x=3690, y=41, Y=83, y++=0] [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=0, x=44, X=90, x=3652, x=3690, Y=83, y=41, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=45, v=-14, X=90, x=45, x=3652, x=3690, Y=83, y=42, y++=491] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-14, x=3690, x=3652, X=90, x=45, Y=83, y=42, y++=491] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-14, x=3735, X=90, x=3780, x=45, Y=83, y=42, y++=491] [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=-14, x=3735, X=90, x=3780, x=45, Y=83, y=42, y++=491] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=46, v=152, x=3735, x=46, x=3780, X=90, y=42, Y=83, y++=491] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=152, X=90, x=46, x=3735, x=3780, y=42, Y=83, y++=491] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=152, x=3780, x=46, x=3818, X=90, Y=83, y=42, y++=491] [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=152, X=90, x=3818, x=3780, x=46, Y=83, y=42, y++=491] [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=138, x=47, x=3818, x=3780, X=90, y=43, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=138, X=90, x=3818, x=3780, x=47, y=43, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=138, x=3901, x=3870, x=47, X=90, y=43, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=138, x=47, x=3901, x=3870, X=90, Y=83, y=43, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=48, v=124, x=48, X=90, x=3901, x=3870, Y=83, y=44, y++=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=124, X=90, x=3901, x=3870, x=48, y=44, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=124, x=3984, X=90, x=48, x=3960, Y=83, y=44, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=124, x=48, X=90, x=3984, x=3960, Y=83, y=44, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=49, v=110, x=3960, X=90, x=3984, x=49, y=45, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=110, x=49, x=3984, X=90, x=3960, y=45, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=110, X=90, x=4067, x=4050, x=49, y=45, Y=83, y++=0] [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=110, X=90, x=4067, x=4050, x=49, y=45, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=50, v=96, X=90, x=50, x=4050, x=4067, Y=83, y=46, y++=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=96, x=4067, X=90, x=4050, x=50, y=46, Y=83, y++=0] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=96, x=50, X=90, x=4150, x=2300, y=46, Y=83, y++=0] [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: 77.7s, OverallIterations: 9, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 926 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1338 IncrementalHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 203 mSDtfsCounter, 1338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2358 GetRequests, 1927 SyntacticMatches, 44 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7160 ImplicationChecksByTransitivity, 61.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=8, InterpolantAutomatonStates: 309, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 4406 SizeOfPredicates, 104 NumberOfNonLiveVariables, 2324 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 5622/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-12-14 03:15:20,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3252c1e-a3d4-4eec-8e4f-82a9c869c5cf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE