./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 8393723b 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_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/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_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS --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-8393723 [2022-11-19 07:35:07,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:35:07,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:35:07,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:35:07,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:35:07,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:35:07,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:35:07,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:35:07,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:35:07,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:35:07,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:35:07,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:35:07,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:35:07,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:35:07,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:35:07,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:35:07,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:35:07,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:35:07,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:35:07,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:35:07,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:35:07,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:35:07,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:35:07,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:35:07,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:35:07,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:35:07,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:35:07,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:35:07,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:35:07,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:35:07,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:35:07,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:35:07,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:35:07,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:35:07,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:35:07,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:35:07,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:35:07,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:35:07,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:35:07,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:35:07,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:35:07,937 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:35:07,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:35:07,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:35:07,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:35:07,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:35:07,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:35:07,984 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:35:07,984 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:35:07,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:35:07,984 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:35:07,984 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:35:07,985 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:35:07,985 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:35:07,985 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:35:07,985 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:35:07,985 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:35:07,986 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:35:07,986 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:35:07,986 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:35:07,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:35:07,988 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:35:07,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:35:07,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:35:07,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:35:07,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:35:07,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:35:07,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:35:07,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:35:07,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:35:07,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:35:07,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:35:07,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:35:07,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:35:07,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:35:07,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:35:07,993 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:35:07,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:35:07,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:35:07,994 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:35:07,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:35:07,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:35:07,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:35:07,995 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_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/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_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2022-11-19 07:35:08,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:35:08,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:35:08,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:35:08,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:35:08,300 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:35:08,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-19 07:35:08,365 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/data/d3321d828/5c0ba8f3e7b94532ba7378ba2f6311e7/FLAGa398f206c [2022-11-19 07:35:08,821 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:35:08,822 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-19 07:35:08,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/data/d3321d828/5c0ba8f3e7b94532ba7378ba2f6311e7/FLAGa398f206c [2022-11-19 07:35:09,191 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/data/d3321d828/5c0ba8f3e7b94532ba7378ba2f6311e7 [2022-11-19 07:35:09,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:35:09,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:35:09,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:35:09,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:35:09,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:35:09,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a1fb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09, skipping insertion in model container [2022-11-19 07:35:09,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:35:09,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:35:09,426 WARN L234 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_47741e9c-7ab5-434e-ba4a-320c9553fe8b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-19 07:35:09,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:35:09,451 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:35:09,463 WARN L234 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_47741e9c-7ab5-434e-ba4a-320c9553fe8b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-19 07:35:09,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:35:09,484 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:35:09,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09 WrapperNode [2022-11-19 07:35:09,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:35:09,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:35:09,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:35:09,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:35:09,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,530 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-19 07:35:09,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:35:09,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:35:09,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:35:09,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:35:09,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:35:09,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:35:09,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:35:09,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:35:09,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (1/1) ... [2022-11-19 07:35:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:35:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:09,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:35:09,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:35:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:35:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:35:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:35:09,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:35:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 07:35:09,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 07:35:09,758 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:35:09,760 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:35:09,946 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:35:09,987 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:35:09,988 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 07:35:09,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:09 BoogieIcfgContainer [2022-11-19 07:35:09,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:35:09,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:35:09,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:35:10,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:35:10,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:09" (1/3) ... [2022-11-19 07:35:10,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96a878a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:10, skipping insertion in model container [2022-11-19 07:35:10,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:09" (2/3) ... [2022-11-19 07:35:10,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96a878a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:10, skipping insertion in model container [2022-11-19 07:35:10,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:09" (3/3) ... [2022-11-19 07:35:10,005 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-11-19 07:35:10,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:35:10,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:35:10,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:35:10,082 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;@16f25584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:35:10,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:35:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:35:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:35:10,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:10,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:10,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-11-19 07:35:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:10,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124191687] [2022-11-19 07:35:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:10,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:35:10,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184408902] [2022-11-19 07:35:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:10,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:10,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:10,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:10,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:35:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:10,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:35:10,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:10,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:35:10,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:10,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124191687] [2022-11-19 07:35:10,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:35:10,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184408902] [2022-11-19 07:35:10,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184408902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:10,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:10,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:35:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466775038] [2022-11-19 07:35:10,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:10,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:35:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:35:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:10,632 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:10,852 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-11-19 07:35:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:35:10,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 07:35:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:10,862 INFO L225 Difference]: With dead ends: 42 [2022-11-19 07:35:10,862 INFO L226 Difference]: Without dead ends: 21 [2022-11-19 07:35:10,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:35:10,868 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:10,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-19 07:35:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-19 07:35:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:35:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-19 07:35:10,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-11-19 07:35:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:10,908 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-19 07:35:10,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-19 07:35:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:35:10,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:10,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:10,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 07:35:11,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-19 07:35:11,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-11-19 07:35:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:11,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224456506] [2022-11-19 07:35:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:11,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:35:11,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695189194] [2022-11-19 07:35:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:11,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:11,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:35:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:11,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 07:35:11,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:11,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:35:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:12,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224456506] [2022-11-19 07:35:12,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:35:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695189194] [2022-11-19 07:35:12,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695189194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:35:12,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378403361] [2022-11-19 07:35:12,503 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-19 07:35:12,503 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:35:12,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:35:12,519 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:35:12,519 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:35:13,257 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-11-19 07:35:13,331 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:35:16,191 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-11-19 07:35:16,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:35:16,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:35:16,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-19 07:35:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843096554] [2022-11-19 07:35:16,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:35:16,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 07:35:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 07:35:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2022-11-19 07:35:16,195 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-11-19 07:35:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:17,117 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-11-19 07:35:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:35:17,118 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-11-19 07:35:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:17,119 INFO L225 Difference]: With dead ends: 35 [2022-11-19 07:35:17,119 INFO L226 Difference]: Without dead ends: 31 [2022-11-19 07:35:17,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=122, Invalid=633, Unknown=1, NotChecked=0, Total=756 [2022-11-19 07:35:17,121 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:17,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 34 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:35:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-19 07:35:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-11-19 07:35:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:35:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-19 07:35:17,136 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-11-19 07:35:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:17,136 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-19 07:35:17,137 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-11-19 07:35:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-19 07:35:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:35:17,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:17,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:17,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:35:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:17,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-11-19 07:35:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526549672] [2022-11-19 07:35:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:17,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:35:17,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689711746] [2022-11-19 07:35:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:17,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:17,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:17,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:17,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:35:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:17,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:35:17,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:17,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:35:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:17,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:17,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526549672] [2022-11-19 07:35:17,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:35:17,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689711746] [2022-11-19 07:35:17,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689711746] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:35:17,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019827985] [2022-11-19 07:35:17,570 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:35:17,570 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:35:17,571 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:35:17,571 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:35:17,571 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:35:18,113 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 07:35:18,266 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:35:27,107 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-11-19 07:35:27,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:35:27,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:35:27,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-19 07:35:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214072374] [2022-11-19 07:35:27,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:35:27,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:35:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:35:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2022-11-19 07:35:27,110 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:35:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:27,301 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-11-19 07:35:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:35:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-19 07:35:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:27,303 INFO L225 Difference]: With dead ends: 59 [2022-11-19 07:35:27,303 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 07:35:27,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=71, Invalid=348, Unknown=1, NotChecked=0, Total=420 [2022-11-19 07:35:27,305 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:27,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 68 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 07:35:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-11-19 07:35:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:35:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-11-19 07:35:27,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-11-19 07:35:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:27,322 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-11-19 07:35:27,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:35:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-11-19 07:35:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:35:27,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:27,324 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:27,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:35:27,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:27,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-11-19 07:35:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:27,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185801637] [2022-11-19 07:35:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:27,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:35:27,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811809175] [2022-11-19 07:35:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:27,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:27,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:27,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:35:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:27,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-19 07:35:27,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:35:28,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:35:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 07:35:29,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:29,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185801637] [2022-11-19 07:35:29,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:35:29,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811809175] [2022-11-19 07:35:29,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811809175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:35:29,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671602612] [2022-11-19 07:35:29,210 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:35:29,210 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:35:29,210 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:35:29,211 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:35:29,211 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:35:29,741 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-11-19 07:35:29,876 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:35:37,743 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-11-19 07:35:37,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:35:37,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:35:37,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2022-11-19 07:35:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938017006] [2022-11-19 07:35:37,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:35:37,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 07:35:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 07:35:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=707, Unknown=1, NotChecked=0, Total=812 [2022-11-19 07:35:37,747 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-11-19 07:35:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:38,919 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-11-19 07:35:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 07:35:38,920 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-11-19 07:35:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:38,920 INFO L225 Difference]: With dead ends: 49 [2022-11-19 07:35:38,921 INFO L226 Difference]: Without dead ends: 41 [2022-11-19 07:35:38,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=191, Invalid=1214, Unknown=1, NotChecked=0, Total=1406 [2022-11-19 07:35:38,923 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:38,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 58 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:35:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-19 07:35:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-19 07:35:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:35:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-11-19 07:35:38,938 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-11-19 07:35:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:38,938 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-11-19 07:35:38,938 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-11-19 07:35:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-11-19 07:35:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 07:35:38,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:38,940 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:38,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-19 07:35:39,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-19 07:35:39,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-11-19 07:35:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:39,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611057118] [2022-11-19 07:35:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:39,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:35:39,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570276757] [2022-11-19 07:35:39,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:35:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:39,156 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:39,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:35:39,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-19 07:35:39,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:35:39,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 07:35:39,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:39,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:35:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 07:35:39,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:39,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611057118] [2022-11-19 07:35:39,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:35:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570276757] [2022-11-19 07:35:39,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570276757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:35:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [687520948] [2022-11-19 07:35:39,610 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:35:39,611 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:35:39,611 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:35:39,611 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:35:39,612 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:35:40,021 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 07:35:40,149 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:35:48,633 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-11-19 07:35:48,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:35:48,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:35:48,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-19 07:35:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318605275] [2022-11-19 07:35:48,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:35:48,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 07:35:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 07:35:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=447, Unknown=2, NotChecked=0, Total=552 [2022-11-19 07:35:48,636 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-19 07:35:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:49,153 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-11-19 07:35:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 07:35:49,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2022-11-19 07:35:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:49,156 INFO L225 Difference]: With dead ends: 95 [2022-11-19 07:35:49,156 INFO L226 Difference]: Without dead ends: 89 [2022-11-19 07:35:49,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=216, Invalid=838, Unknown=2, NotChecked=0, Total=1056 [2022-11-19 07:35:49,157 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 100 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:49,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 92 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:35:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-19 07:35:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-19 07:35:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 07:35:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-11-19 07:35:49,206 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-11-19 07:35:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:49,207 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-11-19 07:35:49,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-19 07:35:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-11-19 07:35:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-19 07:35:49,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:49,212 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:49,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:35:49,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:49,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:35:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-11-19 07:35:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15379336] [2022-11-19 07:35:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:49,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:35:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648611358] [2022-11-19 07:35:49,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:35:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:35:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:49,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:35:49,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:35:49,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:35:49,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:35:49,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-19 07:35:49,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:35:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:35:50,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:35:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-19 07:35:50,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15379336] [2022-11-19 07:35:50,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:35:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648611358] [2022-11-19 07:35:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648611358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:35:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1700618002] [2022-11-19 07:35:50,650 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:35:50,651 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:35:50,651 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:35:50,651 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:35:50,651 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:35:51,058 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 07:35:51,189 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:36:01,611 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 82 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:36:06,419 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-11-19 07:36:06,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:36:06,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:36:06,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-19 07:36:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642852963] [2022-11-19 07:36:06,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:36:06,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 07:36:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:36:06,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 07:36:06,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=945, Unknown=2, NotChecked=0, Total=1260 [2022-11-19 07:36:06,423 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 07:36:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:07,773 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-11-19 07:36:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-19 07:36:07,773 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 88 [2022-11-19 07:36:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:07,775 INFO L225 Difference]: With dead ends: 191 [2022-11-19 07:36:07,775 INFO L226 Difference]: Without dead ends: 185 [2022-11-19 07:36:07,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=828, Invalid=2362, Unknown=2, NotChecked=0, Total=3192 [2022-11-19 07:36:07,778 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 127 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:07,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 182 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:36:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-19 07:36:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-19 07:36:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 139 states have (on average 1.0071942446043165) internal successors, (140), 139 states have internal predecessors, (140), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-19 07:36:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-11-19 07:36:07,827 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-11-19 07:36:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:07,827 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-11-19 07:36:07,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 07:36:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-11-19 07:36:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-19 07:36:07,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:07,831 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:07,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:36:08,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:08,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:36:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-11-19 07:36:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:36:08,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128681754] [2022-11-19 07:36:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:36:08,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:36:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770464332] [2022-11-19 07:36:08,054 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:36:08,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:08,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:36:08,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:36:08,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:36:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:08,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-19 07:36:08,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:36:09,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:36:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-11-19 07:36:11,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:36:11,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128681754] [2022-11-19 07:36:11,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:36:11,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770464332] [2022-11-19 07:36:11,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770464332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:36:11,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [799655164] [2022-11-19 07:36:11,694 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:36:11,694 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:36:11,694 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:36:11,695 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:36:11,695 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:36:12,096 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 07:36:12,209 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:36:14,467 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-11-19 07:36:14,467 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:36:14,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:36:14,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-19 07:36:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351447937] [2022-11-19 07:36:14,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:36:14,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-19 07:36:14,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:36:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-19 07:36:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=2375, Unknown=0, NotChecked=0, Total=3540 [2022-11-19 07:36:14,473 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-19 07:36:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:18,000 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-11-19 07:36:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-19 07:36:18,001 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 184 [2022-11-19 07:36:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:18,004 INFO L225 Difference]: With dead ends: 383 [2022-11-19 07:36:18,004 INFO L226 Difference]: Without dead ends: 377 [2022-11-19 07:36:18,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3348, Invalid=7572, Unknown=0, NotChecked=0, Total=10920 [2022-11-19 07:36:18,008 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 577 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:18,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 278 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-19 07:36:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-19 07:36:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-19 07:36:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 283 states have (on average 1.0035335689045937) internal successors, (284), 283 states have internal predecessors, (284), 47 states have call successors, (47), 47 states have call predecessors, (47), 46 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-19 07:36:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-11-19 07:36:18,096 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-11-19 07:36:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:18,097 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-11-19 07:36:18,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.22) internal successors, (211), 50 states have internal predecessors, (211), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-19 07:36:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-11-19 07:36:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-19 07:36:18,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:18,106 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:18,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:36:18,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:18,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:36:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-11-19 07:36:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:36:18,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086054444] [2022-11-19 07:36:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:36:18,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:36:18,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198158271] [2022-11-19 07:36:18,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:36:18,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:36:18,344 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:36:18,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:36:20,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-19 07:36:20,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:36:20,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-19 07:36:20,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:36:24,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:36:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-11-19 07:36:27,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:36:27,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086054444] [2022-11-19 07:36:27,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-19 07:36:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198158271] [2022-11-19 07:36:27,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198158271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:36:27,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956627084] [2022-11-19 07:36:27,324 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 07:36:27,324 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:36:27,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:36:27,325 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:36:27,325 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:36:27,750 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-19 07:36:27,855 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:36:30,486 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-11-19 07:36:30,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:36:30,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:36:30,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-19 07:36:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600517101] [2022-11-19 07:36:30,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-19 07:36:30,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-19 07:36:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:36:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-19 07:36:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=2669, Unknown=0, NotChecked=0, Total=4032 [2022-11-19 07:36:30,492 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand has 54 states, 54 states have (on average 5.518518518518518) internal successors, (298), 54 states have internal predecessors, (298), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-11-19 07:36:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:34,483 INFO L93 Difference]: Finished difference Result 415 states and 418 transitions. [2022-11-19 07:36:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-19 07:36:34,484 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.518518518518518) internal successors, (298), 54 states have internal predecessors, (298), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 376 [2022-11-19 07:36:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:34,488 INFO L225 Difference]: With dead ends: 415 [2022-11-19 07:36:34,489 INFO L226 Difference]: Without dead ends: 409 [2022-11-19 07:36:34,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1175 GetRequests, 1020 SyntacticMatches, 44 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3235 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3958, Invalid=8698, Unknown=0, NotChecked=0, Total=12656 [2022-11-19 07:36:34,493 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 291 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:34,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 380 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-19 07:36:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-19 07:36:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-11-19 07:36:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 307 states have (on average 1.003257328990228) internal successors, (308), 307 states have internal predecessors, (308), 51 states have call successors, (51), 51 states have call predecessors, (51), 50 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-19 07:36:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2022-11-19 07:36:34,600 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 376 [2022-11-19 07:36:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:34,601 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2022-11-19 07:36:34,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.518518518518518) internal successors, (298), 54 states have internal predecessors, (298), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-11-19 07:36:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2022-11-19 07:36:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-11-19 07:36:34,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:34,611 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:34,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-19 07:36:34,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:34,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:36:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -138579467, now seen corresponding path program 6 times [2022-11-19 07:36:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:36:34,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196885408] [2022-11-19 07:36:34,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:36:34,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-19 07:36:34,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473061618] [2022-11-19 07:36:34,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:36:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:36:34,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:36:34,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:36:36,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:36:36,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:36:36,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:36:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:36:38,091 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:36:38,092 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:36:38,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 07:36:38,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:36:38,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:36:38,308 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-11-19 07:36:38,313 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:36:38,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:36:38 BoogieIcfgContainer [2022-11-19 07:36:38,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:36:38,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:36:38,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:36:38,513 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:36:38,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:09" (3/4) ... [2022-11-19 07:36:38,515 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:36:38,664 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:36:38,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:36:38,665 INFO L158 Benchmark]: Toolchain (without parser) took 89469.60ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 91.6MB in the beginning and 89.3MB in the end (delta: 2.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-11-19 07:36:38,665 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:36:38,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.04ms. Allocated memory is still 132.1MB. Free memory was 91.4MB in the beginning and 105.2MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:36:38,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.33ms. Allocated memory is still 132.1MB. Free memory was 105.2MB in the beginning and 103.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:36:38,666 INFO L158 Benchmark]: Boogie Preprocessor took 34.29ms. Allocated memory is still 132.1MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:36:38,667 INFO L158 Benchmark]: RCFGBuilder took 423.73ms. Allocated memory is still 132.1MB. Free memory was 102.5MB in the beginning and 90.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:36:38,667 INFO L158 Benchmark]: TraceAbstraction took 88519.59ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 89.4MB in the beginning and 108.2MB in the end (delta: -18.8MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2022-11-19 07:36:38,668 INFO L158 Benchmark]: Witness Printer took 151.69ms. Allocated memory is still 159.4MB. Free memory was 108.2MB in the beginning and 89.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 07:36:38,670 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.28ms. Allocated memory is still 132.1MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.04ms. Allocated memory is still 132.1MB. Free memory was 91.4MB in the beginning and 105.2MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.33ms. Allocated memory is still 132.1MB. Free memory was 105.2MB in the beginning and 103.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.29ms. Allocated memory is still 132.1MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.73ms. Allocated memory is still 132.1MB. Free memory was 102.5MB in the beginning and 90.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 88519.59ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 89.4MB in the beginning and 108.2MB in the end (delta: -18.8MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. * Witness Printer took 151.69ms. Allocated memory is still 159.4MB. Free memory was 108.2MB in the beginning and 89.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=76, X=90, x=0, y=0, Y=83] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=76, X=90, x=0, 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=0, x=0, X=90, x=0, Y=83, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=76, x=0, x=0, X=90, x=0, y=0, Y=83] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=1, v=62, X=90, x=0, x=0, x=1, Y=83, y=1, y++=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=62, x=0, x=1, x=0, X=90, y=1, Y=83, 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=90, x=83, 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=2, x=83, X=90, 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=83, y=2, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=48, x=166, X=90, x=180, x=2, y=2, Y=83, 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=90, x=2, x=166, x=180, 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=180, X=90, x=3, x=166, Y=83, y=3, y++=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=34, x=180, X=90, x=166, x=3, Y=83, y=3, 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=3, x=249, x=270, X=90, y=3, Y=83, 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=3, 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=4, v=20, X=90, x=249, x=270, x=4, Y=83, y=4, 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=332, X=90, x=4, x=360, Y=83, y=4, 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=90, x=4, x=360, x=332, 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=360, x=5, X=90, x=332, Y=83, y=5, y++=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=6, X=90, x=360, x=5, 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=415, X=90, x=5, 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=450, x=415, x=5, X=90, 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=90, x=6, x=415, x=450, Y=83, y=6, y++=171] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-8, x=6, X=90, x=450, x=415, 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=7, v=-8, x=540, x=498, x=6, 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=90, x=540, x=6, x=498, y=6, Y=83, 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=90, x=540, x=498, x=7, Y=83, y=6, y++=171] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=158, X=90, x=7, x=540, x=498, 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=90, x=540, x=7, x=581, 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=90, x=540, x=7, 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=8, X=90, x=540, x=581, y=7, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=144, x=8, X=90, x=540, x=581, Y=83, y=7, 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=90, x=664, x=8, y=7, Y=83, 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=664, x=8, x=630, X=90, y=7, 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=9, v=130, x=630, x=664, x=9, X=90, y=8, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=130, X=90, x=9, x=630, x=664, 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=9, x=747, X=90, x=720, 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=747, x=720, X=90, x=9, 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=10, x=720, X=90, y=9, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=116, x=10, X=90, x=720, x=747, 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=90, x=810, x=830, 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=830, x=810, X=90, 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=90, x=810, x=11, x=830, y=10, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=102, X=90, x=830, x=11, x=810, 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=90, x=11, x=913, x=900, Y=83, y=10, 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=90, x=913, x=11, x=900, 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=12, x=900, X=90, Y=83, y=11, y++=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=88, X=90, x=12, x=900, x=913, y=11, Y=83, 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=990, x=996, x=12, X=90, 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=990, x=996, x=12, Y=83, y=11, 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=990, X=90, x=996, x=13, y=12, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=74, X=90, x=996, x=13, x=990, Y=83, y=12, 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=90, x=1080, x=1079, x=13, 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=13, x=1080, x=1079, Y=83, y=12, 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=90, x=1079, x=1080, x=14, Y=83, y=13, y++=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=60, x=14, X=90, x=1080, x=1079, y=13, Y=83, 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=1170, X=90, x=14, x=1162, y=13, Y=83, 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=90, x=14, x=1162, 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=1162, x=1170, x=15, X=90, Y=83, y=14, y++=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=46, x=1162, x=15, x=1170, X=90, y=14, Y=83, 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=1245, x=15, x=1260, y=14, Y=83, 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=1245, x=15, X=90, x=1260, 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=1260, X=90, x=16, x=1245, Y=83, y=15, y++=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=32, X=90, x=1260, x=1245, x=16, 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=1328, x=1350, x=16, 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=1328, X=90, x=16, 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=1350, x=17, x=1328, X=90, Y=83, y=16, y++=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=18, x=1350, X=90, x=1328, x=17, Y=83, y=16, 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=17, x=1440, X=90, x=1411, 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=17, x=1411, X=90, y=16, 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=18, v=4, X=90, x=1440, x=18, x=1411, y=17, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=4, x=18, X=90, x=1411, x=1440, 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=90, x=1494, x=18, x=1530, Y=83, y=17, 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=1494, x=18, x=1530, X=90, 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=1494, X=90, x=1530, y=18, Y=83, y++=277] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-10, x=19, X=90, x=1494, 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=90, x=1577, x=19, x=1620, 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=19, x=1577, x=1620, 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=1620, x=1577, X=90, x=20, Y=83, y=18, y++=277] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=156, x=20, X=90, x=1577, x=1620, 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=90, x=20, x=1660, x=1620, 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=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=90, x=1620, x=1660, 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=21, x=1660, Y=83, y=19, y++=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=142, x=1620, x=1660, X=90, 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=83, y=19, 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=90, x=21, 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=22, x=1710, x=1743, X=90, 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=22, x=1826, X=90, 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=1800, X=90, x=1826, Y=83, y=20, 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=1800, x=23, X=90, x=1826, Y=83, y=21, y++=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=114, X=90, x=1826, x=1800, x=23, 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=23, x=1909, x=1890, X=90, Y=83, y=21, 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=1890, x=23, X=90, x=1909, y=21, 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=24, v=100, X=90, x=24, x=1890, x=1909, y=22, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=100, x=1890, X=90, x=24, 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=90, x=1980, x=1992, x=24, 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=90, x=1980, x=1992, Y=83, y=22, 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=25, x=1992, x=1980, X=90, Y=83, y=23, y++=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=86, x=1992, x=1980, X=90, x=25, Y=83, y=23, 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=25, x=2075, X=90, x=2070, 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=2070, x=2075, x=25, X=90, 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=2075, x=2070, X=90, x=26, y=24, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=72, x=26, x=2075, X=90, x=2070, y=24, Y=83, 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=26, X=90, x=2160, x=2158, 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=90, x=2158, x=26, x=2160, 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=90, x=27, Y=83, y=25, y++=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=58, x=2158, X=90, x=27, x=2160, 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=27, X=90, x=2250, x=2241, Y=83, y=25, 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=2241, x=27, X=90, x=2250, y=25, 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=28, v=44, X=90, x=2250, x=2241, x=28, Y=83, y=26, y++=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=44, x=2250, X=90, x=28, x=2241, 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=2324, x=2340, x=28, X=90, y=26, Y=83, 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=2340, x=2324, X=90, x=28, 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=2324, x=29, x=2340, X=90, Y=83, y=27, y++=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=30, x=2324, X=90, x=2340, 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=29, X=90, x=2407, x=2430, Y=83, y=27, 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=2430, x=2407, X=90, x=29, Y=83, y=27, 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=2430, x=2407, X=90, x=30, Y=83, y=28, y++=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=16, X=90, x=2407, x=2430, x=30, 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=30, x=2490, X=90, x=2520, 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=90, x=2520, x=30, x=2490, Y=83, y=28, 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=90, x=2520, x=2490, x=31, Y=83, y=29, y++=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=2, x=2520, x=31, X=90, x=2490, y=29, Y=83, 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=90, x=2610, x=31, y=29, Y=83, 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=31, x=2610, x=2573, X=90, Y=83, y=29, 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=2610, x=2573, X=90, x=32, Y=83, y=30, y++=385] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-12, x=2573, x=2610, X=90, x=32, 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=2656, x=32, x=2700, y=30, Y=83, 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=2656, X=90, x=32, x=2700, 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=33, X=90, x=2656, y=30, Y=83, y++=385] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=154, x=2656, X=90, x=33, x=2700, 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=2700, x=2739, X=90, 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=33, x=2700, x=2739, y=30, Y=83, 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=34, X=90, x=2739, x=2700, y=31, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=140, X=90, x=2700, x=34, x=2739, 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=2790, X=90, x=2822, x=34, 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=2790, x=34, x=2822, X=90, 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=2790, x=2822, Y=83, y=32, y++=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=126, x=2822, x=35, x=2790, X=90, 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=2880, x=2905, y=32, Y=83, 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=90, x=2880, x=35, x=2905, y=32, 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=36, v=112, x=2880, X=90, x=36, x=2905, Y=83, y=33, y++=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=112, X=90, x=2905, x=36, x=2880, 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=36, X=90, x=2988, x=2970, y=33, Y=83, 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=36, x=2988, x=2970, X=90, Y=83, y=33, 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=2970, x=2988, x=37, X=90, Y=83, y=34, y++=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=98, X=90, x=2970, x=2988, x=37, y=34, Y=83, 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=3071, x=3060, x=37, X=90, 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=90, x=3071, x=37, x=3060, Y=83, y=34, 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=38, x=3060, x=3071, X=90, y=35, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=84, x=3060, x=3071, X=90, 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=3154, X=90, x=3150, x=38, Y=83, y=35, 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=3154, X=90, x=38, x=3150, Y=83, y=35, 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=3150, X=90, x=3154, x=39, y=36, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=70, x=3150, x=39, x=3154, X=90, Y=83, y=36, 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=3240, x=39, X=90, x=3237, 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=90, x=39, Y=83, y=36, 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=40, x=3237, X=90, x=3240, Y=83, y=37, y++=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=56, x=3237, x=3240, x=40, X=90, 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=3320, x=40, X=90, x=3330, 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=40, x=3330, x=3320, X=90, 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=3330, x=41, X=90, x=3320, y=38, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=42, x=3320, X=90, x=41, x=3330, 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=41, X=90, x=3420, x=3403, y=38, Y=83, 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=90, x=3420, x=41, x=3403, 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=3420, x=3403, y=39, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=28, x=3420, x=42, x=3403, X=90, y=39, Y=83, 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=39, Y=83, 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=42, x=3510, X=90, x=3486, 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=3510, x=43, X=90, x=3486, 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=3600, x=43, X=90, Y=83, y=40, 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=43, x=3600, x=3569, X=90, 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=44, x=3569, X=90, x=3600, Y=83, y=41, y++=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=0, X=90, x=3569, x=44, x=3600, Y=83, y=41, 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=44, x=3652, x=3690, X=90, 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=3652, x=3690, X=90, 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=45, X=90, x=3780, x=3735, 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=3780, x=46, X=90, x=3735, Y=83, y=42, y++=491] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=152, x=46, x=3780, X=90, x=3735, 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=47, v=152, X=90, x=3780, x=3818, x=46, y=42, Y=83, 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=3818, x=3780, X=90, x=46, y=42, Y=83, 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=3780, X=90, x=47, x=3818, y=43, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=138, x=3818, x=3780, x=47, X=90, Y=83, y=43, 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=47, x=3901, x=3870, 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=3870, x=3901, X=90, x=47, 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=3870, x=3901, Y=83, y=44, y++=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=124, x=3870, x=3901, X=90, 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=90, x=48, x=3984, x=3960, y=44, Y=83, 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=3960, x=3984, x=48, X=90, 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=49, X=90, x=3960, x=3984, Y=83, y=45, y++=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=110, x=3984, x=3960, x=49, X=90, 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=49, x=4050, X=90, x=4067, 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=49, x=4050, X=90, x=4067, Y=83, y=45, 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=4050, x=50, x=4067, y=46, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=96, x=50, x=4050, x=4067, X=90, Y=83, y=46, 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=90, x=50, x=2300, x=4150, Y=83, y=46, 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: 88.2s, OverallIterations: 9, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1228 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1228 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 926 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1338 IncrementalHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 203 mSDtfsCounter, 1338 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2358 GetRequests, 1927 SyntacticMatches, 44 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7169 ImplicationChecksByTransitivity, 64.7s 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 4435 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-11-19 07:36:38,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47741e9c-7ab5-434e-ba4a-320c9553fe8b/bin/utaipan-I9t0OCRTmS/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