./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-009.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-009.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur --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 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 --- 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-38b53e6 [2022-11-26 00:02:43,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:02:43,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:02:43,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:02:43,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:02:43,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:02:43,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:02:43,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:02:43,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:02:43,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:02:43,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:02:43,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:02:43,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:02:43,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:02:43,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:02:43,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:02:43,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:02:43,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:02:43,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:02:43,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:02:43,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:02:43,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:02:43,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:02:43,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:02:43,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:02:43,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:02:43,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:02:43,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:02:43,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:02:43,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:02:43,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:02:43,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:02:43,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:02:43,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:02:43,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:02:43,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:02:43,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:02:43,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:02:43,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:02:43,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:02:43,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:02:43,132 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:02:43,154 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:02:43,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:02:43,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:02:43,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:02:43,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:02:43,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:02:43,156 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:02:43,156 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:02:43,157 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:02:43,157 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:02:43,157 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:02:43,158 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:02:43,158 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:02:43,158 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:02:43,158 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:02:43,159 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:02:43,159 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:02:43,159 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:02:43,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:02:43,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:02:43,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:02:43,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:02:43,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:02:43,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:02:43,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:02:43,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:02:43,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:02:43,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:02:43,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:02:43,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:02:43,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:02:43,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:02:43,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:02:43,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:02:43,164 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:02:43,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:02:43,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:02:43,165 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:02:43,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:02:43,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:02:43,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:02:43,166 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_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/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_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur 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 -> 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 [2022-11-26 00:02:43,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:02:43,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:02:43,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:02:43,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:02:43,449 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:02:43,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/xcsp/AllInterval-009.c [2022-11-26 00:02:46,563 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:02:46,802 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:02:46,803 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/sv-benchmarks/c/xcsp/AllInterval-009.c [2022-11-26 00:02:46,810 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/data/7ca09c709/8defcc8a801d4f0a878cf75a3fcfbc74/FLAG461c502ef [2022-11-26 00:02:46,829 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/data/7ca09c709/8defcc8a801d4f0a878cf75a3fcfbc74 [2022-11-26 00:02:46,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:02:46,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:02:46,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:02:46,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:02:46,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:02:46,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:46" (1/1) ... [2022-11-26 00:02:46,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e33cc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:46, skipping insertion in model container [2022-11-26 00:02:46,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:46" (1/1) ... [2022-11-26 00:02:46,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:02:46,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:02:47,119 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/sv-benchmarks/c/xcsp/AllInterval-009.c[5030,5043] [2022-11-26 00:02:47,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:02:47,148 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:02:47,215 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/sv-benchmarks/c/xcsp/AllInterval-009.c[5030,5043] [2022-11-26 00:02:47,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:02:47,245 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:02:47,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47 WrapperNode [2022-11-26 00:02:47,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:02:47,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:02:47,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:02:47,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:02:47,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,308 INFO L138 Inliner]: procedures = 13, calls = 113, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 208 [2022-11-26 00:02:47,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:02:47,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:02:47,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:02:47,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:02:47,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:02:47,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:02:47,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:02:47,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:02:47,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (1/1) ... [2022-11-26 00:02:47,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:02:47,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:02:47,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:02:47,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:02:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:02:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:02:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:02:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:02:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-11-26 00:02:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-11-26 00:02:47,523 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:02:47,526 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:02:48,022 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:02:48,054 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:02:48,054 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:02:48,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:48 BoogieIcfgContainer [2022-11-26 00:02:48,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:02:48,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:02:48,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:02:48,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:02:48,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:02:46" (1/3) ... [2022-11-26 00:02:48,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f6d7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:48, skipping insertion in model container [2022-11-26 00:02:48,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:47" (2/3) ... [2022-11-26 00:02:48,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f6d7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:48, skipping insertion in model container [2022-11-26 00:02:48,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:48" (3/3) ... [2022-11-26 00:02:48,069 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-009.c [2022-11-26 00:02:48,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:02:48,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:02:48,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:02:48,167 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;@4e932381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:02:48,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:02:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2022-11-26 00:02:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-11-26 00:02:48,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:02:48,201 INFO L195 NwaCegarLoop]: trace histogram [106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:02:48,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:02:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:02:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -590559468, now seen corresponding path program 1 times [2022-11-26 00:02:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:02:48,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344162381] [2022-11-26 00:02:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:02:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:02:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:02:57,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:02:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:02:59,887 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:02:59,890 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:02:59,891 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:02:59,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:02:59,900 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-26 00:02:59,911 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:03:00,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:03:00 BoogieIcfgContainer [2022-11-26 00:03:00,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:03:00,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:03:00,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:03:00,105 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:03:00,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:48" (3/4) ... [2022-11-26 00:03:00,107 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:03:00,308 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:03:00,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:03:00,310 INFO L158 Benchmark]: Toolchain (without parser) took 13475.54ms. Allocated memory was 157.3MB in the beginning and 618.7MB in the end (delta: 461.4MB). Free memory was 124.4MB in the beginning and 294.2MB in the end (delta: -169.7MB). Peak memory consumption was 292.4MB. Max. memory is 16.1GB. [2022-11-26 00:03:00,314 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory was 91.3MB in the beginning and 91.2MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:03:00,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.75ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 120.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:03:00,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.26ms. Allocated memory is still 157.3MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:03:00,316 INFO L158 Benchmark]: Boogie Preprocessor took 28.12ms. Allocated memory is still 157.3MB. Free memory was 117.9MB in the beginning and 116.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:03:00,316 INFO L158 Benchmark]: RCFGBuilder took 719.88ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 95.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 00:03:00,317 INFO L158 Benchmark]: TraceAbstraction took 12043.22ms. Allocated memory was 157.3MB in the beginning and 618.7MB in the end (delta: 461.4MB). Free memory was 94.9MB in the beginning and 309.9MB in the end (delta: -215.0MB). Peak memory consumption was 248.2MB. Max. memory is 16.1GB. [2022-11-26 00:03:00,317 INFO L158 Benchmark]: Witness Printer took 204.54ms. Allocated memory is still 618.7MB. Free memory was 309.9MB in the beginning and 294.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 00:03:00,319 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 121.6MB. Free memory was 91.3MB in the beginning and 91.2MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.75ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 120.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.26ms. Allocated memory is still 157.3MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.12ms. Allocated memory is still 157.3MB. Free memory was 117.9MB in the beginning and 116.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 719.88ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 95.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12043.22ms. Allocated memory was 157.3MB in the beginning and 618.7MB in the end (delta: 461.4MB). Free memory was 94.9MB in the beginning and 309.9MB in the end (delta: -215.0MB). Peak memory consumption was 248.2MB. Max. memory is 16.1GB. * Witness Printer took 204.54ms. Allocated memory is still 618.7MB. Free memory was 309.9MB in the beginning and 294.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: 185]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=6] [L30] CALL assume(var0 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L30] RET assume(var0 <= 8) VAL [dummy=0, var0=6] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=6, var1=4] [L34] CALL assume(var1 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L34] RET assume(var1 <= 8) VAL [dummy=0, var0=6, var1=4] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3] [L38] CALL assume(var2 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L38] RET assume(var2 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7] [L42] CALL assume(var3 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L42] RET assume(var3 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1] [L46] CALL assume(var4 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L46] RET assume(var4 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8] [L50] CALL assume(var5 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L50] RET assume(var5 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0] [L54] CALL assume(var6 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L54] RET assume(var6 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5] [L58] CALL assume(var7 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L58] RET assume(var7 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L61] RET assume(var8 >= 0) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2] [L62] CALL assume(var8 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L62] RET assume(var8 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L66] CALL assume(var9 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L66] RET assume(var9 <= 8) VAL [dummy=0, var0=6, var1=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L70] CALL assume(var10 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L70] RET assume(var10 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L74] CALL assume(var11 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L74] RET assume(var11 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L78] CALL assume(var12 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L78] RET assume(var12 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L82] CALL assume(var13 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L82] RET assume(var13 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L86] CALL assume(var14 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L86] RET assume(var14 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L89] RET assume(var15 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L90] CALL assume(var15 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L90] RET assume(var15 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L93] RET assume(var16 >= 1) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L94] CALL assume(var16 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L94] RET assume(var16 <= 8) VAL [dummy=0, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L95] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L96] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L96] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L97] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L97] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L98] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L98] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L99] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L99] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L100] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L100] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L101] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L101] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L102] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L102] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L103] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L103] RET assume(var0 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L104] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L104] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L105] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L105] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L106] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L106] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L107] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L107] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L108] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L108] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L109] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L109] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L110] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L110] RET assume(var1 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L111] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L111] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L112] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L112] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L113] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L113] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L114] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L114] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L115] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L115] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L116] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L116] RET assume(var2 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L117] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L117] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L118] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L118] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L119] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L119] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L120] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L120] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L121] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L121] RET assume(var3 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L122] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L122] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L123] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L123] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L124] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L124] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L125] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L125] RET assume(var4 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L126] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L126] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L127] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L127] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L128] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L128] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L129] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L129] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L130] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L130] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L131] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L131] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L132] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L132] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L133] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L133] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L134] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L134] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L135] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L135] RET assume(var9 != var13) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L136] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L136] RET assume(var9 != var14) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L137] CALL assume(var9 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L137] RET assume(var9 != var15) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L138] CALL assume(var9 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L138] RET assume(var9 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L139] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L139] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L140] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L140] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L141] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L141] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L142] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L142] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L143] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L143] RET assume(var10 != var15) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L144] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L144] RET assume(var10 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L145] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L145] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L146] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L146] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L147] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L147] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L148] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L148] RET assume(var11 != var15) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L149] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L149] RET assume(var11 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L150] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L150] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L151] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L151] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L152] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L152] RET assume(var12 != var15) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L153] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L153] RET assume(var12 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L154] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L154] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L155] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L155] RET assume(var13 != var15) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L156] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L156] RET assume(var13 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L157] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L157] RET assume(var14 != var15) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L158] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L158] RET assume(var14 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L159] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L159] RET assume(var15 != var16) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2] [L160] int var_for_abs; [L161] var_for_abs = var0 - var1 [L162] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=2] [L163] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L163] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=2] [L164] var_for_abs = var1 - var2 [L165] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=1] [L166] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L166] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=1] [L167] var_for_abs = var2 - var3 [L168] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=4] [L169] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L169] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=4] [L170] var_for_abs = var3 - var4 [L171] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=6] [L172] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L172] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=6] [L173] var_for_abs = var4 - var5 [L174] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=7] [L175] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L175] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=7] [L176] var_for_abs = var5 - var6 [L177] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=8] [L178] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L178] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=8] [L179] var_for_abs = var6 - var7 [L180] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=5] [L181] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L181] RET assume(var15 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=5] [L182] var_for_abs = var7 - var8 [L183] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=3] [L184] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L184] RET assume(var16 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=3] [L185] reach_error() VAL [dummy=0, myvar0=1, var0=6, var1=4, var10=1, var11=4, var12=6, var13=7, var14=8, var15=5, var16=3, var2=3, var3=7, var4=1, var5=8, var6=0, var7=5, var8=2, var9=2, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 1, TraceHistogramMax: 106, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 8.9s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-26 00:03:00,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd2d3559-4695-4f7d-bd7a-28368bb25668/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE