./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/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_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 14:05:56,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:05:56,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:05:56,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:05:56,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:05:56,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:05:56,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:05:56,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:05:56,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:05:56,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:05:56,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:05:56,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:05:56,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:05:56,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:05:56,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:05:56,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:05:56,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:05:56,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:05:56,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:05:56,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:05:56,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:05:56,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:05:56,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:05:56,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:05:56,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:05:56,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:05:56,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:05:56,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:05:56,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:05:56,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:05:56,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:05:56,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:05:56,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:05:56,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:05:56,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:05:56,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:05:56,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:05:56,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:05:56,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:05:56,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:05:56,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:05:56,362 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:05:56,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:05:56,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:05:56,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:05:56,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:05:56,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:05:56,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:05:56,394 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:05:56,394 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:05:56,394 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:05:56,394 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:05:56,395 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:05:56,395 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:05:56,395 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:05:56,395 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:05:56,396 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:05:56,396 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:05:56,396 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:05:56,396 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:05:56,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:05:56,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:05:56,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:05:56,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:05:56,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:05:56,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:05:56,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:05:56,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:05:56,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:05:56,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:05:56,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:05:56,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:05:56,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:05:56,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:05:56,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:05:56,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:05:56,401 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:05:56,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:05:56,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:05:56,402 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:05:56,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:05:56,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:05:56,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:05:56,403 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_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/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_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW 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-23 14:05:56,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:05:56,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:05:56,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:05:56,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:05:56,682 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:05:56,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-23 14:05:59,681 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:05:59,866 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:05:59,867 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-23 14:05:59,874 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/data/09a0a937a/94f9953d99a7429b9b39f4fca08cdacb/FLAGa7df0ddfd [2022-11-23 14:05:59,889 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/data/09a0a937a/94f9953d99a7429b9b39f4fca08cdacb [2022-11-23 14:05:59,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:05:59,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:05:59,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:05:59,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:05:59,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:05:59,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:59" (1/1) ... [2022-11-23 14:05:59,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666e2c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:59, skipping insertion in model container [2022-11-23 14:05:59,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:59" (1/1) ... [2022-11-23 14:05:59,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:05:59,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:06:00,105 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_54189f60-76ea-418e-9377-eb409a3f3b05/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-23 14:06:00,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:06:00,155 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:06:00,165 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_54189f60-76ea-418e-9377-eb409a3f3b05/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-23 14:06:00,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:06:00,185 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:06:00,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00 WrapperNode [2022-11-23 14:06:00,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:06:00,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:06:00,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:06:00,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:06:00,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,234 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-23 14:06:00,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:06:00,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:06:00,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:06:00,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:06:00,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:06:00,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:06:00,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:06:00,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:06:00,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (1/1) ... [2022-11-23 14:06:00,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:06:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:00,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:06:00,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:06:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:06:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:06:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:06:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:06:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 14:06:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 14:06:00,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:06:00,441 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:06:00,674 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:06:00,776 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:06:00,776 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 14:06:00,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:00 BoogieIcfgContainer [2022-11-23 14:06:00,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:06:00,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:06:00,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:06:00,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:06:00,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:05:59" (1/3) ... [2022-11-23 14:06:00,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1411f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:06:00, skipping insertion in model container [2022-11-23 14:06:00,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:06:00" (2/3) ... [2022-11-23 14:06:00,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1411f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:06:00, skipping insertion in model container [2022-11-23 14:06:00,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:00" (3/3) ... [2022-11-23 14:06:00,789 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-11-23 14:06:00,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:06:00,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 14:06:00,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:06:00,869 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;@2da381b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:06:00,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 14:06:00,874 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-23 14:06:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:06:00,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:00,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:00,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2022-11-23 14:06:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:00,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463474629] [2022-11-23 14:06:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:01,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788101229] [2022-11-23 14:06:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:01,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:01,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:06:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:01,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 14:06:01,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:01,334 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-23 14:06:01,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:06:01,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:01,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463474629] [2022-11-23 14:06:01,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:01,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788101229] [2022-11-23 14:06:01,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788101229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:06:01,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:06:01,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:06:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507409787] [2022-11-23 14:06:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:06:01,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:06:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:06:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:06:01,380 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-23 14:06:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:01,513 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-11-23 14:06:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:06:01,516 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-23 14:06:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:01,524 INFO L225 Difference]: With dead ends: 42 [2022-11-23 14:06:01,525 INFO L226 Difference]: Without dead ends: 21 [2022-11-23 14:06:01,528 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-23 14:06:01,532 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-23 14:06:01,533 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-23 14:06:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-23 14:06:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-23 14:06:01,574 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-23 14:06:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-23 14:06:01,577 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-11-23 14:06:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:01,578 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-23 14:06:01,578 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-23 14:06:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-23 14:06:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:06:01,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:01,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:01,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 14:06:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-23 14:06:01,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1971909778, now seen corresponding path program 1 times [2022-11-23 14:06:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:01,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776906910] [2022-11-23 14:06:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:01,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:01,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:01,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271088428] [2022-11-23 14:06:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:01,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:01,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:06:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:01,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 14:06:01,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:02,581 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-23 14:06:02,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:03,121 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-23 14:06:03,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:03,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776906910] [2022-11-23 14:06:03,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:03,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271088428] [2022-11-23 14:06:03,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271088428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:03,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477139136] [2022-11-23 14:06:03,158 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-23 14:06:03,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:03,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:06:03,180 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:06:03,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:06:03,844 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2022-11-23 14:06:03,915 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:06:07,032 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-23 14:06:07,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:06:07,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:06:07,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-11-23 14:06:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506605738] [2022-11-23 14:06:07,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:07,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 14:06:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:07,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 14:06:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2022-11-23 14:06:07,035 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-23 14:06:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:07,851 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-11-23 14:06:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:06:07,852 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-23 14:06:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:07,853 INFO L225 Difference]: With dead ends: 35 [2022-11-23 14:06:07,853 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 14:06:07,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=122, Invalid=633, Unknown=1, NotChecked=0, Total=756 [2022-11-23 14:06:07,854 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:07,855 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.5s Time] [2022-11-23 14:06:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 14:06:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-11-23 14:06:07,865 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-23 14:06:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-23 14:06:07,866 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-11-23 14:06:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:07,867 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-23 14:06:07,867 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-23 14:06:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-23 14:06:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 14:06:07,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:07,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:07,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:08,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-23 14:06:08,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 927087193, now seen corresponding path program 1 times [2022-11-23 14:06:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:08,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401652851] [2022-11-23 14:06:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:08,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:08,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247812090] [2022-11-23 14:06:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:08,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:08,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:06:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:08,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:06:08,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:08,214 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-23 14:06:08,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:08,271 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-23 14:06:08,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:08,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401652851] [2022-11-23 14:06:08,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:08,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247812090] [2022-11-23 14:06:08,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247812090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:08,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [577213615] [2022-11-23 14:06:08,275 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-23 14:06:08,275 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:08,275 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:06:08,275 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:06:08,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:06:08,802 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-23 14:06:08,966 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:06:10,198 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-23 14:06:10,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:06:10,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:06:10,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-23 14:06:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832204210] [2022-11-23 14:06:10,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:10,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:06:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:10,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:06:10,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-23 14:06:10,200 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-23 14:06:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:10,341 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-11-23 14:06:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 14:06:10,342 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-23 14:06:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:10,343 INFO L225 Difference]: With dead ends: 59 [2022-11-23 14:06:10,343 INFO L226 Difference]: Without dead ends: 53 [2022-11-23 14:06:10,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-23 14:06:10,344 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-23 14:06:10,345 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-23 14:06:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-23 14:06:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-11-23 14:06:10,365 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-23 14:06:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-11-23 14:06:10,368 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-11-23 14:06:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:10,368 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-11-23 14:06:10,369 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-23 14:06:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-11-23 14:06:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:06:10,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:10,370 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:10,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:10,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:10,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1587911935, now seen corresponding path program 1 times [2022-11-23 14:06:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:10,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886932997] [2022-11-23 14:06:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:10,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:10,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144884445] [2022-11-23 14:06:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:10,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:10,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:10,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:10,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:06:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:10,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 14:06:10,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:11,350 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-23 14:06:11,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:11,886 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-23 14:06:11,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886932997] [2022-11-23 14:06:11,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144884445] [2022-11-23 14:06:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144884445] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [286737928] [2022-11-23 14:06:11,889 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-23 14:06:11,890 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:11,890 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:06:11,890 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:06:11,891 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:06:12,362 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 86 for LOIs [2022-11-23 14:06:12,713 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:06:19,119 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-23 14:06:19,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:06:19,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:06:19,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2022-11-23 14:06:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657259020] [2022-11-23 14:06:19,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:19,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 14:06:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:19,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 14:06:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:06:19,122 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-23 14:06:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:20,087 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-11-23 14:06:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 14:06:20,088 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-23 14:06:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:20,089 INFO L225 Difference]: With dead ends: 49 [2022-11-23 14:06:20,089 INFO L226 Difference]: Without dead ends: 41 [2022-11-23 14:06:20,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 14:06:20,091 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:20,091 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.4s Time] [2022-11-23 14:06:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-23 14:06:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-23 14:06:20,106 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-23 14:06:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-11-23 14:06:20,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 22 [2022-11-23 14:06:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:20,108 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-11-23 14:06:20,108 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-23 14:06:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-11-23 14:06:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 14:06:20,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:20,109 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:20,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:20,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:20,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1355163283, now seen corresponding path program 2 times [2022-11-23 14:06:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:20,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628536254] [2022-11-23 14:06:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:20,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:20,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622263734] [2022-11-23 14:06:20,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:06:20,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:20,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:20,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:06:20,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 14:06:20,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:06:20,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 14:06:20,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:20,529 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-23 14:06:20,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:20,683 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-23 14:06:20,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:20,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628536254] [2022-11-23 14:06:20,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:20,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622263734] [2022-11-23 14:06:20,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622263734] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:20,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [27392256] [2022-11-23 14:06:20,686 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-23 14:06:20,686 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:20,686 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:06:20,686 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:06:20,687 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:06:21,140 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-23 14:06:21,279 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:06:34,527 WARN L233 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 84 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:06:37,904 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-23 14:06:37,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:06:37,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:06:37,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-23 14:06:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272208352] [2022-11-23 14:06:37,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:37,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:06:37,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:06:37,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=447, Unknown=2, NotChecked=0, Total=552 [2022-11-23 14:06:37,908 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-23 14:06:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:38,345 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-11-23 14:06:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 14:06:38,345 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-23 14:06:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:38,347 INFO L225 Difference]: With dead ends: 95 [2022-11-23 14:06:38,347 INFO L226 Difference]: Without dead ends: 89 [2022-11-23 14:06:38,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=216, Invalid=838, Unknown=2, NotChecked=0, Total=1056 [2022-11-23 14:06:38,348 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-23 14:06:38,349 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-23 14:06:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-23 14:06:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-23 14:06:38,385 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-23 14:06:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-11-23 14:06:38,393 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 40 [2022-11-23 14:06:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:38,394 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-11-23 14:06:38,394 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-23 14:06:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-11-23 14:06:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-23 14:06:38,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:38,398 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:38,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:38,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:38,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149589, now seen corresponding path program 3 times [2022-11-23 14:06:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:38,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491401816] [2022-11-23 14:06:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:38,619 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:38,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600292702] [2022-11-23 14:06:38,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:06:38,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:38,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:38,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:38,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:06:38,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:06:38,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:06:38,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 14:06:38,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:39,147 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-23 14:06:39,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:39,665 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-23 14:06:39,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:39,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491401816] [2022-11-23 14:06:39,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:39,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600292702] [2022-11-23 14:06:39,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600292702] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:39,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [23130790] [2022-11-23 14:06:39,668 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-23 14:06:39,668 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:39,668 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:06:39,668 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:06:39,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:06:40,078 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-23 14:06:40,202 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:06:41,750 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-23 14:06:41,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:06:41,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:06:41,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-23 14:06:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430605978] [2022-11-23 14:06:41,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:06:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:06:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 14:06:41,754 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-23 14:06:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:42,862 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-11-23 14:06:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-23 14:06:42,863 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-23 14:06:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:42,866 INFO L225 Difference]: With dead ends: 191 [2022-11-23 14:06:42,866 INFO L226 Difference]: Without dead ends: 185 [2022-11-23 14:06:42,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=828, Invalid=2364, Unknown=0, NotChecked=0, Total=3192 [2022-11-23 14:06:42,869 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 127 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:06:42,869 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.4s Time] [2022-11-23 14:06:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-23 14:06:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-23 14:06:42,925 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-23 14:06:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2022-11-23 14:06:42,926 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 88 [2022-11-23 14:06:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:42,927 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2022-11-23 14:06:42,928 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-23 14:06:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2022-11-23 14:06:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-23 14:06:42,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:42,931 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:42,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:43,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:43,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash 112256997, now seen corresponding path program 4 times [2022-11-23 14:06:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:43,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978331056] [2022-11-23 14:06:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:43,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:43,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501456011] [2022-11-23 14:06:43,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:06:43,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:43,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:43,187 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:43,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:06:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:06:43,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 14:06:43,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:06:44,351 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-23 14:06:44,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:06:45,889 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-23 14:06:45,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:06:45,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978331056] [2022-11-23 14:06:45,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:06:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501456011] [2022-11-23 14:06:45,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501456011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:06:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836351770] [2022-11-23 14:06:45,892 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-23 14:06:45,892 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:06:45,893 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:06:45,893 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:06:45,893 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:06:46,341 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-23 14:06:46,467 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:06:53,636 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-23 14:06:53,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:06:53,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:06:53,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-23 14:06:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063258553] [2022-11-23 14:06:53,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:06:53,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 14:06:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:06:53,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 14:06:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1164, Invalid=2374, Unknown=2, NotChecked=0, Total=3540 [2022-11-23 14:06:53,642 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-23 14:06:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:06:56,755 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2022-11-23 14:06:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-23 14:06:56,758 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-23 14:06:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:06:56,762 INFO L225 Difference]: With dead ends: 383 [2022-11-23 14:06:56,762 INFO L226 Difference]: Without dead ends: 377 [2022-11-23 14:06:56,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=3347, Invalid=7571, Unknown=2, NotChecked=0, Total=10920 [2022-11-23 14:06:56,766 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-23 14:06:56,767 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-23 14:06:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-23 14:06:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-23 14:06:56,845 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-23 14:06:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2022-11-23 14:06:56,848 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 184 [2022-11-23 14:06:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:06:56,848 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2022-11-23 14:06:56,849 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-23 14:06:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2022-11-23 14:06:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-11-23 14:06:56,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:06:56,855 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2022-11-23 14:06:56,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:06:57,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 14:06:57,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:06:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:06:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 99823749, now seen corresponding path program 5 times [2022-11-23 14:06:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:06:57,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953460285] [2022-11-23 14:06:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:06:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:06:57,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:06:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345044754] [2022-11-23 14:06:57,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:06:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:06:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:06:57,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:06:57,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:06:59,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-23 14:06:59,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:06:59,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-23 14:06:59,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:07:02,372 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-23 14:07:02,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:07:05,041 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-23 14:07:05,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:07:05,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953460285] [2022-11-23 14:07:05,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:07:05,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345044754] [2022-11-23 14:07:05,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345044754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:07:05,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19991387] [2022-11-23 14:07:05,046 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-23 14:07:05,049 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:07:05,049 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:07:05,049 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:07:05,050 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:07:05,442 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 80 for LOIs [2022-11-23 14:07:05,585 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:07:12,832 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-23 14:07:12,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:07:12,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:07:12,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-23 14:07:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553866398] [2022-11-23 14:07:12,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:07:12,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-23 14:07:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:07:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-23 14:07:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=2667, Unknown=2, NotChecked=0, Total=4032 [2022-11-23 14:07:12,838 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-23 14:07:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:07:16,054 INFO L93 Difference]: Finished difference Result 415 states and 418 transitions. [2022-11-23 14:07:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-23 14:07:16,055 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-23 14:07:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:07:16,060 INFO L225 Difference]: With dead ends: 415 [2022-11-23 14:07:16,060 INFO L226 Difference]: Without dead ends: 409 [2022-11-23 14:07:16,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1175 GetRequests, 1020 SyntacticMatches, 44 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3958, Invalid=8696, Unknown=2, NotChecked=0, Total=12656 [2022-11-23 14:07:16,065 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 291 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:07:16,065 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.7s Time] [2022-11-23 14:07:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-23 14:07:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-11-23 14:07:16,155 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-23 14:07:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2022-11-23 14:07:16,157 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 376 [2022-11-23 14:07:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:07:16,159 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2022-11-23 14:07:16,159 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-23 14:07:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2022-11-23 14:07:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-11-23 14:07:16,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:07:16,168 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2022-11-23 14:07:16,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:07:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-23 14:07:16,381 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:07:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:07:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash -138579467, now seen corresponding path program 6 times [2022-11-23 14:07:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:07:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464334711] [2022-11-23 14:07:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:07:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:07:16,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:07:16,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015193809] [2022-11-23 14:07:16,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:07:16,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:07:16,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:07:16,424 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:07:16,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:07:17,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:07:17,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 14:07:17,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:07:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:07:19,407 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:07:19,407 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:07:19,408 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 14:07:19,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:07:19,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:07:19,625 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-11-23 14:07:19,630 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:07:19,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:07:19 BoogieIcfgContainer [2022-11-23 14:07:19,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:07:19,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:07:19,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:07:19,809 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:07:19,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:06:00" (3/4) ... [2022-11-23 14:07:19,813 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 14:07:19,986 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:07:19,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:07:19,987 INFO L158 Benchmark]: Toolchain (without parser) took 80094.08ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 114.0MB in the beginning and 73.2MB in the end (delta: 40.8MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2022-11-23 14:07:19,987 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 157.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:07:19,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.70ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 103.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 14:07:19,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.96ms. Allocated memory is still 157.3MB. Free memory was 103.1MB in the beginning and 101.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:07:19,989 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 157.3MB. Free memory was 101.3MB in the beginning and 100.5MB in the end (delta: 847.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:07:19,989 INFO L158 Benchmark]: RCFGBuilder took 506.15ms. Allocated memory is still 157.3MB. Free memory was 100.5MB in the beginning and 87.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 14:07:19,990 INFO L158 Benchmark]: TraceAbstraction took 79026.64ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 86.7MB in the beginning and 93.1MB in the end (delta: -6.4MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2022-11-23 14:07:19,990 INFO L158 Benchmark]: Witness Printer took 177.47ms. Allocated memory is still 211.8MB. Free memory was 93.1MB in the beginning and 73.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 14:07:19,998 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.29ms. Allocated memory is still 157.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.70ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 103.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.96ms. Allocated memory is still 157.3MB. Free memory was 103.1MB in the beginning and 101.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 157.3MB. Free memory was 101.3MB in the beginning and 100.5MB in the end (delta: 847.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 506.15ms. Allocated memory is still 157.3MB. Free memory was 100.5MB in the beginning and 87.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 79026.64ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 86.7MB in the beginning and 93.1MB in the end (delta: -6.4MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Witness Printer took 177.47ms. Allocated memory is still 211.8MB. Free memory was 93.1MB in the beginning and 73.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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=83, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=76, X=90, x=0, Y=83, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=76, X=90, x=0, x=0, x=0, Y=83, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=1, unknown-#in~cond-unknown=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=0, x=0, x=1, X=90, Y=83, y=1, y++=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=62, x=1, x=0, X=90, x=0, Y=83, y=1, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=62, x=1, X=90, x=83, x=90, Y=83, y=1, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=2, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=62, x=83, x=90, X=90, x=1, 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=90, x=90, x=2, x=83, Y=83, y=2, y++=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=48, X=90, x=90, x=2, x=83, y=2, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=48, x=180, x=2, X=90, x=166, Y=83, y=2, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=3, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=48, x=166, X=90, x=2, x=180, Y=83, y=2, 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=90, x=3, x=180, x=166, y=3, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=34, x=3, x=166, X=90, x=180, 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=270, X=90, x=249, x=3, Y=83, y=3, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=4, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=34, x=3, x=249, X=90, 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=4, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=20, X=90, x=249, x=270, x=4, y=4, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=20, x=4, x=332, x=360, X=90, Y=83, y=4, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=5, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=20, x=4, x=332, x=360, X=90, y=4, 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=5, v=6, X=90, x=332, x=360, x=5, y=5, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=6, X=90, x=360, x=332, x=5, y=5, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=6, X=90, x=5, x=415, x=450, Y=83, y=5, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=6, unknown-#in~cond-unknown=1] [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=90, x=5, 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=450, x=415, x=6, y=6, Y=83, y++=171] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-8, X=90, x=450, x=415, x=6, y=6, Y=83, y++=171] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-8, X=90, x=6, x=498, x=540, Y=83, y=6, y++=171] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=7, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-8, x=6, X=90, x=498, x=540, Y=83, y=6, y++=171] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [counter=7, v=158, x=540, x=7, X=90, x=498, y=6, Y=83, y++=171] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=158, x=540, X=90, x=498, x=7, 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=7, x=540, x=581, Y=83, y=6, y++=171] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=8, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=158, x=581, X=90, x=540, x=7, 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=581, x=8, x=540, X=90, y=7, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=144, x=540, x=581, x=8, X=90, y=7, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=144, x=8, x=664, x=630, X=90, y=7, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=9, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=144, x=8, X=90, x=664, x=630, 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=664, x=630, X=90, x=9, y=8, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=130, x=664, x=630, x=9, X=90, 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=720, x=747, X=90, x=9, Y=83, y=8, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=10, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=130, x=720, X=90, x=747, 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=10, x=720, X=90, x=747, y=9, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=116, X=90, x=720, x=10, x=747, Y=83, y=9, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=116, x=830, x=810, X=90, x=10, Y=83, y=9, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=11, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=116, x=810, x=830, 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=11, x=830, x=810, X=90, y=10, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=102, x=830, x=11, X=90, x=810, Y=83, y=10, 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=900, x=11, x=913, X=90, Y=83, y=10, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=12, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=102, X=90, x=11, x=913, x=900, Y=83, y=10, 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=12, x=913, x=900, X=90, y=11, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=88, X=90, x=12, x=900, x=913, Y=83, y=11, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=88, x=12, X=90, x=996, x=990, y=11, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=13, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=88, X=90, x=12, x=990, x=996, y=11, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=13, v=74, X=90, x=13, x=990, x=996, y=12, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=74, x=13, x=996, x=990, X=90, 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=1079, x=1080, x=13, X=90, y=12, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=14, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=74, X=90, x=1079, x=1080, x=13, y=12, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=14, v=60, x=1079, x=1080, X=90, x=14, Y=83, y=13, y++=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=60, x=1080, X=90, x=14, 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=1162, x=1170, X=90, x=14, y=13, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=15, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=60, x=14, x=1162, x=1170, X=90, Y=83, y=13, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=15, v=46, x=1162, x=15, x=1170, X=90, y=14, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=46, x=1170, x=1162, X=90, x=15, Y=83, y=14, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=46, X=90, x=1245, x=15, x=1260, Y=83, y=14, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=16, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=46, x=1260, X=90, x=15, x=1245, y=14, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=16, v=32, x=1245, x=16, x=1260, X=90, y=15, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=32, x=16, x=1260, x=1245, X=90, Y=83, y=15, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=32, X=90, x=16, x=1328, x=1350, y=15, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=17, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=32, X=90, x=16, x=1328, x=1350, y=15, 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=17, v=18, x=1350, x=1328, x=17, X=90, Y=83, y=16, y++=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=18, x=1350, x=1328, X=90, 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=1411, X=90, Y=83, y=16, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=18, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=18, x=17, x=1411, X=90, x=1440, 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=1440, x=1411, X=90, x=18, Y=83, y=17, y++=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=4, X=90, x=1411, x=18, x=1440, y=17, Y=83, 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=1494, x=18, X=90, x=1530, y=17, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=19, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=4, x=1530, x=1494, X=90, x=18, y=17, 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=19, v=-10, X=90, x=1494, x=19, x=1530, y=18, Y=83, y++=277] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-10, x=1530, x=19, x=1494, X=90, y=18, Y=83, y++=277] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-10, x=1620, x=19, x=1577, X=90, Y=83, y=18, y++=277] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=20, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-10, X=90, x=1620, x=19, x=1577, y=18, Y=83, 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=1577, X=90, x=1620, x=20, Y=83, y=18, y++=277] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=156, x=20, X=90, x=1620, x=1577, Y=83, y=18, 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=1620, x=1660, Y=83, y=18, y++=277] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=21, unknown-#in~cond-unknown=1] [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=83, y=18, 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=21, X=90, x=1660, y=19, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=142, x=21, x=1660, x=1620, X=90, Y=83, y=19, 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=21, X=90, x=1743, y=19, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=22, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=142, X=90, x=1710, x=1743, x=21, y=19, 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=22, v=128, x=22, X=90, x=1743, x=1710, y=20, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=128, x=22, X=90, x=1710, x=1743, 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=1800, X=90, x=1826, Y=83, y=20, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=23, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=128, x=1800, x=1826, X=90, x=22, y=20, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=23, v=114, X=90, x=1800, x=23, x=1826, y=21, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=114, X=90, x=23, x=1800, x=1826, Y=83, y=21, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=114, x=1909, X=90, x=23, x=1890, y=21, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=24, unknown-#in~cond-unknown=1] [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=24, x=1890, x=1909, X=90, y=22, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=100, X=90, x=1909, x=24, x=1890, 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=24, x=1992, X=90, x=1980, Y=83, y=22, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=25, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=100, X=90, x=1980, x=1992, x=24, y=22, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=25, v=86, x=1980, x=1992, X=90, x=25, 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=2070, X=90, x=2075, y=23, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=26, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=86, x=25, x=2075, X=90, x=2070, y=23, 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=26, v=72, x=26, x=2075, x=2070, X=90, Y=83, y=24, 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=2160, x=2158, x=26, X=90, y=24, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=27, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=72, x=2160, x=2158, X=90, x=26, 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=25, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=58, x=2160, X=90, x=2158, x=27, y=25, Y=83, 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=2241, X=90, x=2250, y=25, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=28, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=58, x=2241, X=90, x=2250, x=27, 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=28, x=2250, x=2241, X=90, Y=83, y=26, y++=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=44, x=2241, x=2250, x=28, X=90, 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=90, x=2340, x=28, Y=83, y=26, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=29, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=44, x=28, X=90, x=2340, x=2324, y=26, 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=29, v=30, x=29, x=2340, x=2324, X=90, Y=83, y=27, y++=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=30, X=90, x=29, x=2324, x=2340, Y=83, y=27, 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=2430, x=2407, X=90, Y=83, y=27, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=30, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=30, X=90, x=2407, x=2430, 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=90, x=2407, x=30, Y=83, y=28, y++=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=16, x=2407, X=90, x=2430, x=30, y=28, Y=83, 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=2520, X=90, x=2490, y=28, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=31, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=16, X=90, x=30, x=2520, x=2490, y=28, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=31, v=2, x=31, x=2490, x=2520, X=90, Y=83, y=29, y++=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=2, x=31, X=90, x=2490, x=2520, 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=90, x=2610, x=31, x=2573, Y=83, y=29, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=32, unknown-#in~cond-unknown=1] [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=29, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=32, v=-12, x=32, x=2573, x=2610, X=90, Y=83, y=30, y++=385] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-12, x=32, x=2610, x=2573, X=90, 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=33, v=-12, x=32, X=90, x=2656, x=2700, y=30, Y=83, y++=385] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=33, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-12, x=32, X=90, x=2656, x=2700, Y=83, y=30, 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=2656, x=2700, X=90, x=33, Y=83, y=30, y++=385] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=154, x=2700, x=2656, x=33, X=90, 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=2739, x=2700, X=90, x=33, Y=83, y=30, y++=385] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=34, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=154, x=2739, x=2700, X=90, x=33, 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=90, x=34, x=2739, x=2700, y=31, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=140, x=2739, x=34, X=90, x=2700, 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=34, x=2790, x=2822, X=90, Y=83, y=31, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=35, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=140, x=2822, X=90, x=34, x=2790, 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=90, x=2790, x=35, x=2822, y=32, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=126, x=35, x=2822, X=90, x=2790, Y=83, y=32, 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=2905, X=90, x=35, x=2880, y=32, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=36, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=126, x=35, x=2905, x=2880, X=90, Y=83, y=32, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=36, v=112, x=2880, X=90, x=2905, x=36, y=33, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=112, x=2880, x=36, X=90, x=2905, Y=83, y=33, 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=2970, x=2988, X=90, y=33, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=37, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=112, x=36, X=90, x=2970, x=2988, 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=2988, x=37, x=2970, X=90, y=34, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=98, x=2970, x=37, X=90, x=2988, 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=37, X=90, x=3060, Y=83, y=34, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=38, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=98, x=37, x=3060, x=3071, X=90, 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=90, x=3071, x=3060, Y=83, y=35, y++=0] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=84, X=90, x=3071, x=38, x=3060, y=35, Y=83, 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 [counter=39, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=39, unknown-#in~cond-unknown=1] [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=35, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=39, v=70, x=3154, X=90, x=39, x=3150, y=36, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=70, x=39, x=3150, X=90, x=3154, 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=90, x=39, x=3237, Y=83, y=36, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=40, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=70, X=90, x=3237, x=39, x=3240, 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=3237, X=90, x=3240, x=40, Y=83, y=37, y++=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=56, X=90, x=3237, x=3240, x=40, 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=3330, x=40, X=90, x=3320, y=37, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=41, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=56, X=90, x=40, x=3330, x=3320, y=37, 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=41, v=42, x=3320, x=3330, X=90, x=41, y=38, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=42, x=3330, x=41, X=90, x=3320, y=38, Y=83, 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=3403, X=90, x=3420, x=41, Y=83, y=38, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=42, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=42, x=41, X=90, x=3420, 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=42, x=3403, x=3420, X=90, y=39, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=28, x=42, x=3420, x=3403, X=90, Y=83, y=39, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=28, x=3510, x=3486, x=42, X=90, y=39, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=43, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=28, X=90, x=3510, x=3486, x=42, y=39, Y=83, y++=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [counter=43, v=14, x=3486, X=90, x=3510, x=43, Y=83, y=40, y++=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=14, x=3486, X=90, x=3510, x=43, 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 [counter=44, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=44, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=14, x=3600, X=90, x=3569, x=43, y=40, 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=44, v=0, X=90, x=44, x=3600, x=3569, Y=83, y=41, y++=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=0, x=3569, x=44, X=90, 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=3690, X=90, x=3652, x=44, y=41, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=45, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=0, x=44, x=3690, x=3652, X=90, y=41, 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=45, v=-14, x=3690, X=90, x=3652, x=45, y=42, Y=83, y++=491] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-14, X=90, x=3652, x=45, x=3690, 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=90, x=3780, x=3735, x=45, y=42, Y=83, y++=491] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=46, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-14, X=90, x=45, x=3780, x=3735, y=42, Y=83, 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=46, x=3780, X=90, x=3735, y=42, Y=83, y++=491] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=152, x=3780, X=90, x=46, x=3735, y=42, Y=83, y++=491] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=152, x=3780, x=3818, X=90, x=46, y=42, Y=83, y++=491] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=47, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=152, x=3780, X=90, x=3818, 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=90, x=3780, x=3818, x=47, y=43, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=138, x=3818, X=90, x=3780, x=47, y=43, Y=83, y++=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=138, x=3901, X=90, x=47, x=3870, Y=83, y=43, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=48, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=138, X=90, x=47, x=3870, x=3901, y=43, 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=48, v=124, X=90, x=3901, x=3870, x=48, Y=83, y=44, y++=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=124, x=3901, x=3870, 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=48, x=3960, X=90, x=3984, y=44, Y=83, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=49, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=124, X=90, x=48, x=3960, x=3984, 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=90, x=3984, x=49, x=3960, Y=83, y=45, 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=4050, x=49, X=90, x=4067, Y=83, y=45, y++=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, unknown-#in~cond-unknown=1] [L14] COND FALSE !(!(cond)) VAL [cond=1, counter=50, unknown-#in~cond-unknown=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=110, x=49, x=4067, x=4050, X=90, 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=50, X=90, x=4067, x=4050, y=46, Y=83, y++=0] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=96, x=50, X=90, x=4067, x=4050, y=46, Y=83, y++=0] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=96, x=2300, x=50, X=90, x=4150, y=46, Y=83, y++=0] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [counter=51, unknown-#in~cond-unknown=0] [L14] COND TRUE !(cond) VAL [cond=0, counter=51, unknown-#in~cond-unknown=0] [L16] reach_error() VAL [cond=0, counter=51, unknown-#in~cond-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.8s, OverallIterations: 9, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1228 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1228 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 2.8s 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.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2358 GetRequests, 1927 SyntacticMatches, 44 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7170 ImplicationChecksByTransitivity, 56.3s 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 4406 SizeOfPredicates, 104 NumberOfNonLiveVariables, 2324 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 5622/21770 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 14:07:20,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54189f60-76ea-418e-9377-eb409a3f3b05/bin/utaipan-Q6hlc19bkW/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