./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:28:46,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:28:46,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:28:46,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:28:46,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:28:46,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:28:46,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:28:46,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:28:46,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:28:46,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:28:46,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:28:46,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:28:46,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:28:46,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:28:46,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:28:46,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:28:46,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:28:46,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:28:46,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:28:46,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:28:46,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:28:46,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:28:46,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:28:46,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:28:46,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:28:46,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:28:46,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:28:46,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:28:46,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:28:46,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:28:46,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:28:46,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:28:46,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:28:46,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:28:46,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:28:46,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:28:46,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:28:46,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:28:46,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:28:46,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:28:46,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:28:46,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 14:28:46,642 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:28:46,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:28:46,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:28:46,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:28:46,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:28:46,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:28:46,643 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:28:46,643 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:28:46,643 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:28:46,643 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:28:46,643 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:28:46,643 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:28:46,644 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:28:46,644 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:28:46,644 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:28:46,644 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:28:46,644 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:28:46,644 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:28:46,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:28:46,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:28:46,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:28:46,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:28:46,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:28:46,647 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:28:46,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:28:46,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:28:46,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:28:46,647 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_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2022-12-14 14:28:46,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:28:46,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:28:46,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:28:46,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:28:46,835 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:28:46,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/toy2.cil.c [2022-12-14 14:28:49,402 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:28:49,555 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:28:49,555 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/sv-benchmarks/c/systemc/toy2.cil.c [2022-12-14 14:28:49,561 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/data/e7e100de5/5e71db2393e04aa7a3b6008b176af253/FLAG5e40c6e30 [2022-12-14 14:28:49,571 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/data/e7e100de5/5e71db2393e04aa7a3b6008b176af253 [2022-12-14 14:28:49,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:28:49,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:28:49,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:28:49,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:28:49,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:28:49,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2626567a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49, skipping insertion in model container [2022-12-14 14:28:49,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:28:49,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:28:49,710 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_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/sv-benchmarks/c/systemc/toy2.cil.c[698,711] [2022-12-14 14:28:49,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:28:49,779 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:28:49,788 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_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/sv-benchmarks/c/systemc/toy2.cil.c[698,711] [2022-12-14 14:28:49,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:28:49,837 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:28:49,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49 WrapperNode [2022-12-14 14:28:49,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:28:49,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:28:49,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:28:49,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:28:49,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,876 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 361 [2022-12-14 14:28:49,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:28:49,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:28:49,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:28:49,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:28:49,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,903 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:28:49,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:28:49,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:28:49,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:28:49,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (1/1) ... [2022-12-14 14:28:49,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:28:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:28:49,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:28:49,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:28:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:28:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:28:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:28:49,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:28:50,034 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:28:50,036 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:28:50,355 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:28:50,563 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:28:50,564 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 14:28:50,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:28:50 BoogieIcfgContainer [2022-12-14 14:28:50,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:28:50,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:28:50,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:28:50,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:28:50,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:28:49" (1/3) ... [2022-12-14 14:28:50,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f93ba73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:28:50, skipping insertion in model container [2022-12-14 14:28:50,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:28:49" (2/3) ... [2022-12-14 14:28:50,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f93ba73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:28:50, skipping insertion in model container [2022-12-14 14:28:50,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:28:50" (3/3) ... [2022-12-14 14:28:50,573 INFO L112 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2022-12-14 14:28:50,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:28:50,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 14:28:50,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:28:50,644 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;@6d0a2e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:28:50,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 14:28:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.675) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:28:50,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:50,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:28:50,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:28:50,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1605280445, now seen corresponding path program 1 times [2022-12-14 14:28:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186105383] [2022-12-14 14:28:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:50,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186105383] [2022-12-14 14:28:50,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186105383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:50,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:50,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:28:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822525454] [2022-12-14 14:28:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:50,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:28:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:28:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:28:50,886 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.675) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:50,972 INFO L93 Difference]: Finished difference Result 109 states and 175 transitions. [2022-12-14 14:28:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:28:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:28:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:50,981 INFO L225 Difference]: With dead ends: 109 [2022-12-14 14:28:50,981 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 14:28:50,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:28:50,986 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:50,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:28:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 14:28:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-12-14 14:28:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 63 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2022-12-14 14:28:51,017 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 13 [2022-12-14 14:28:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:51,017 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2022-12-14 14:28:51,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2022-12-14 14:28:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 14:28:51,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:51,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:28:51,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:28:51,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:28:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash -15381714, now seen corresponding path program 1 times [2022-12-14 14:28:51,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:51,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70551074] [2022-12-14 14:28:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:51,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:51,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70551074] [2022-12-14 14:28:51,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70551074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:51,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:51,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:28:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826698600] [2022-12-14 14:28:51,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:51,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:28:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:28:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:28:51,128 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:51,189 INFO L93 Difference]: Finished difference Result 116 states and 181 transitions. [2022-12-14 14:28:51,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:28:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 14:28:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:51,191 INFO L225 Difference]: With dead ends: 116 [2022-12-14 14:28:51,191 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 14:28:51,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:28:51,193 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:51,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 98 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:28:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 14:28:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-12-14 14:28:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2022-12-14 14:28:51,202 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 22 [2022-12-14 14:28:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:51,203 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2022-12-14 14:28:51,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2022-12-14 14:28:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:28:51,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:51,204 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:28:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:28:51,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:28:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash 891401571, now seen corresponding path program 1 times [2022-12-14 14:28:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:51,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945538527] [2022-12-14 14:28:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:51,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:51,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945538527] [2022-12-14 14:28:51,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945538527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:51,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:51,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:28:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61607259] [2022-12-14 14:28:51,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:51,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:28:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:51,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:28:51,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:28:51,373 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:51,449 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2022-12-14 14:28:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:28:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 14:28:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:51,451 INFO L225 Difference]: With dead ends: 217 [2022-12-14 14:28:51,451 INFO L226 Difference]: Without dead ends: 147 [2022-12-14 14:28:51,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:28:51,452 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 58 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:51,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 119 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:28:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-14 14:28:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 111. [2022-12-14 14:28:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 110 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 169 transitions. [2022-12-14 14:28:51,464 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 169 transitions. Word has length 26 [2022-12-14 14:28:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:51,464 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 169 transitions. [2022-12-14 14:28:51,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 169 transitions. [2022-12-14 14:28:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 14:28:51,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:51,465 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:28:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:28:51,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:28:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 104731208, now seen corresponding path program 1 times [2022-12-14 14:28:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460068566] [2022-12-14 14:28:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:28:51,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460068566] [2022-12-14 14:28:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460068566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:51,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:51,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:28:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118558313] [2022-12-14 14:28:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:51,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:28:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:28:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:28:51,576 INFO L87 Difference]: Start difference. First operand 111 states and 169 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:51,669 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2022-12-14 14:28:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:28:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 14:28:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:51,672 INFO L225 Difference]: With dead ends: 291 [2022-12-14 14:28:51,672 INFO L226 Difference]: Without dead ends: 221 [2022-12-14 14:28:51,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:28:51,673 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 122 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:51,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 125 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:28:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-14 14:28:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 189. [2022-12-14 14:28:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.553191489361702) internal successors, (292), 188 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 292 transitions. [2022-12-14 14:28:51,689 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 292 transitions. Word has length 34 [2022-12-14 14:28:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:51,690 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 292 transitions. [2022-12-14 14:28:51,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 292 transitions. [2022-12-14 14:28:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 14:28:51,691 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:51,692 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:28:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:28:51,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:28:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1383911911, now seen corresponding path program 1 times [2022-12-14 14:28:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:51,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813757280] [2022-12-14 14:28:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:52,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:52,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813757280] [2022-12-14 14:28:52,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813757280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:28:52,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619072886] [2022-12-14 14:28:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:52,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:28:52,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:28:52,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:28:52,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:28:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:52,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 14:28:52,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:28:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:53,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:28:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:55,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619072886] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:28:55,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76874103] [2022-12-14 14:28:55,349 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 14:28:55,349 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:28:55,352 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:28:55,356 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:28:55,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:29:43,533 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:29:47,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [76874103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:47,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:29:47,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [9, 9, 13] total 47 [2022-12-14 14:29:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511478091] [2022-12-14 14:29:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:47,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 14:29:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 14:29:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1777, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 14:29:47,041 INFO L87 Difference]: Start difference. First operand 189 states and 292 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:49,042 INFO L93 Difference]: Finished difference Result 448 states and 678 transitions. [2022-12-14 14:29:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:29:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-14 14:29:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:49,043 INFO L225 Difference]: With dead ends: 448 [2022-12-14 14:29:49,043 INFO L226 Difference]: Without dead ends: 264 [2022-12-14 14:29:49,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=576, Invalid=2286, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 14:29:49,045 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:49,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 101 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:29:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-12-14 14:29:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2022-12-14 14:29:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4330357142857142) internal successors, (321), 224 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 321 transitions. [2022-12-14 14:29:49,062 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 321 transitions. Word has length 49 [2022-12-14 14:29:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:49,062 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 321 transitions. [2022-12-14 14:29:49,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 321 transitions. [2022-12-14 14:29:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 14:29:49,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:49,063 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:29:49,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:29:49,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:29:49,265 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:29:49,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1599464788, now seen corresponding path program 1 times [2022-12-14 14:29:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:49,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983644466] [2022-12-14 14:29:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:29:49,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983644466] [2022-12-14 14:29:49,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983644466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:49,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:49,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:29:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123987075] [2022-12-14 14:29:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:29:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:29:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:29:49,335 INFO L87 Difference]: Start difference. First operand 225 states and 321 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:49,398 INFO L93 Difference]: Finished difference Result 490 states and 712 transitions. [2022-12-14 14:29:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:29:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-14 14:29:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:49,400 INFO L225 Difference]: With dead ends: 490 [2022-12-14 14:29:49,400 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 14:29:49,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:29:49,402 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:49,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 80 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:29:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 14:29:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2022-12-14 14:29:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.437956204379562) internal successors, (394), 274 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 394 transitions. [2022-12-14 14:29:49,419 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 394 transitions. Word has length 49 [2022-12-14 14:29:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:49,419 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 394 transitions. [2022-12-14 14:29:49,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 394 transitions. [2022-12-14 14:29:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 14:29:49,420 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:49,420 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:29:49,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:29:49,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:29:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1163684892, now seen corresponding path program 1 times [2022-12-14 14:29:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:49,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753362455] [2022-12-14 14:29:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:29:49,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:49,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753362455] [2022-12-14 14:29:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753362455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:49,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:49,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:29:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695931043] [2022-12-14 14:29:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:49,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:29:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:29:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:29:49,467 INFO L87 Difference]: Start difference. First operand 275 states and 394 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:49,543 INFO L93 Difference]: Finished difference Result 537 states and 787 transitions. [2022-12-14 14:29:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:29:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-12-14 14:29:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:49,545 INFO L225 Difference]: With dead ends: 537 [2022-12-14 14:29:49,545 INFO L226 Difference]: Without dead ends: 339 [2022-12-14 14:29:49,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:29:49,547 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 45 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:49,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:29:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-12-14 14:29:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 309. [2022-12-14 14:29:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.422077922077922) internal successors, (438), 308 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 438 transitions. [2022-12-14 14:29:49,562 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 438 transitions. Word has length 50 [2022-12-14 14:29:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:49,563 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 438 transitions. [2022-12-14 14:29:49,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 438 transitions. [2022-12-14 14:29:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 14:29:49,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:49,564 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:29:49,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:29:49,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:29:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash 992853944, now seen corresponding path program 1 times [2022-12-14 14:29:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:49,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187957666] [2022-12-14 14:29:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:49,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187957666] [2022-12-14 14:29:49,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187957666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:29:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785375891] [2022-12-14 14:29:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:49,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:29:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:29:49,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:29:49,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:29:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:49,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 14:29:49,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:29:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 14:29:50,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:29:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 14:29:50,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785375891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:29:50,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1944436935] [2022-12-14 14:29:50,290 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 14:29:50,290 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:29:50,291 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:29:50,291 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:29:50,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:31:58,527 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:32:03,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1944436935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:32:03,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:32:03,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [9, 4, 9] total 38 [2022-12-14 14:32:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403840203] [2022-12-14 14:32:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:03,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 14:32:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 14:32:03,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1085, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 14:32:03,133 INFO L87 Difference]: Start difference. First operand 309 states and 438 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:05,597 INFO L93 Difference]: Finished difference Result 637 states and 927 transitions. [2022-12-14 14:32:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:32:05,597 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-14 14:32:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:05,600 INFO L225 Difference]: With dead ends: 637 [2022-12-14 14:32:05,600 INFO L226 Difference]: Without dead ends: 406 [2022-12-14 14:32:05,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=417, Invalid=1475, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 14:32:05,602 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:05,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 99 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:32:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-12-14 14:32:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 323. [2022-12-14 14:32:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.4161490683229814) internal successors, (456), 322 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 456 transitions. [2022-12-14 14:32:05,624 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 456 transitions. Word has length 57 [2022-12-14 14:32:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:05,624 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 456 transitions. [2022-12-14 14:32:05,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2022-12-14 14:32:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 14:32:05,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:05,625 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:32:05,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:32:05,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:05,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:32:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1895911658, now seen corresponding path program 1 times [2022-12-14 14:32:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:05,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050630931] [2022-12-14 14:32:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 14:32:05,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:05,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050630931] [2022-12-14 14:32:05,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050630931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:32:05,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:32:05,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:32:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770341486] [2022-12-14 14:32:05,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:05,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:32:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:32:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:32:05,908 INFO L87 Difference]: Start difference. First operand 323 states and 456 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:05,974 INFO L93 Difference]: Finished difference Result 607 states and 885 transitions. [2022-12-14 14:32:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:32:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 14:32:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:05,976 INFO L225 Difference]: With dead ends: 607 [2022-12-14 14:32:05,976 INFO L226 Difference]: Without dead ends: 376 [2022-12-14 14:32:05,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:32:05,977 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:05,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 57 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:32:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-12-14 14:32:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 324. [2022-12-14 14:32:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.3653250773993808) internal successors, (441), 323 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 441 transitions. [2022-12-14 14:32:06,011 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 441 transitions. Word has length 58 [2022-12-14 14:32:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:06,011 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 441 transitions. [2022-12-14 14:32:06,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 441 transitions. [2022-12-14 14:32:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 14:32:06,013 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:06,013 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:32:06,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:32:06,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:32:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 505342558, now seen corresponding path program 1 times [2022-12-14 14:32:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:06,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71341533] [2022-12-14 14:32:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 14:32:06,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:06,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71341533] [2022-12-14 14:32:06,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71341533] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:06,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319529599] [2022-12-14 14:32:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:06,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:06,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:32:06,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:32:06,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:32:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:06,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 14:32:06,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:32:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 14:32:06,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:32:06,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319529599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:32:06,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:32:06,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-12-14 14:32:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609482202] [2022-12-14 14:32:06,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:06,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:32:06,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:06,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:32:06,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:32:06,383 INFO L87 Difference]: Start difference. First operand 324 states and 441 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:06,482 INFO L93 Difference]: Finished difference Result 583 states and 794 transitions. [2022-12-14 14:32:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:32:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-12-14 14:32:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:06,483 INFO L225 Difference]: With dead ends: 583 [2022-12-14 14:32:06,483 INFO L226 Difference]: Without dead ends: 188 [2022-12-14 14:32:06,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:32:06,484 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:06,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 142 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:32:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-14 14:32:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2022-12-14 14:32:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.2265193370165746) internal successors, (222), 181 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 222 transitions. [2022-12-14 14:32:06,508 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 222 transitions. Word has length 68 [2022-12-14 14:32:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:06,509 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 222 transitions. [2022-12-14 14:32:06,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 222 transitions. [2022-12-14 14:32:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 14:32:06,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:06,510 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:32:06,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:32:06,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 14:32:06,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:32:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1774535435, now seen corresponding path program 1 times [2022-12-14 14:32:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998864641] [2022-12-14 14:32:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 14:32:07,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:07,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998864641] [2022-12-14 14:32:07,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998864641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:07,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096929783] [2022-12-14 14:32:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:07,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:07,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:32:07,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:32:07,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:32:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:07,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 14:32:07,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:32:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 14:32:07,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:32:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096929783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:32:07,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:32:07,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-12-14 14:32:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940740207] [2022-12-14 14:32:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:07,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:32:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:32:07,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:32:07,151 INFO L87 Difference]: Start difference. First operand 182 states and 222 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:07,245 INFO L93 Difference]: Finished difference Result 321 states and 401 transitions. [2022-12-14 14:32:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:32:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-12-14 14:32:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:07,247 INFO L225 Difference]: With dead ends: 321 [2022-12-14 14:32:07,247 INFO L226 Difference]: Without dead ends: 219 [2022-12-14 14:32:07,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-14 14:32:07,248 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 61 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:07,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 170 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:32:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-14 14:32:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-12-14 14:32:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.2122641509433962) internal successors, (257), 212 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2022-12-14 14:32:07,271 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 70 [2022-12-14 14:32:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:07,271 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2022-12-14 14:32:07,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2022-12-14 14:32:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 14:32:07,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:07,273 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:32:07,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:32:07,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 14:32:07,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 14:32:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -832673612, now seen corresponding path program 1 times [2022-12-14 14:32:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:07,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112071127] [2022-12-14 14:32:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:32:08,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112071127] [2022-12-14 14:32:08,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112071127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870181285] [2022-12-14 14:32:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:08,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:08,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:32:08,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:32:08,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:32:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:08,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 14:32:08,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:32:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 14:32:08,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:32:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 14:32:08,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870181285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:32:08,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899387327] [2022-12-14 14:32:08,919 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-12-14 14:32:08,919 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:32:08,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:32:08,920 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:32:08,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:38:19,160 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-12-14 14:38:19,167 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-12-14 14:39:12,934 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-12-14 14:39:20,670 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-12-14 14:39:20,676 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-12-14 14:40:09,003 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-12-14 14:40:34,523 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:40:40,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1899387327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:40:40,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:40,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [15, 9, 11] total 52 [2022-12-14 14:40:40,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581247240] [2022-12-14 14:40:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:40:40,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 14:40:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 14:40:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2344, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 14:40:40,184 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:40:43,437 INFO L93 Difference]: Finished difference Result 293 states and 357 transitions. [2022-12-14 14:40:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 14:40:43,437 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-12-14 14:40:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:40:43,437 INFO L225 Difference]: With dead ends: 293 [2022-12-14 14:40:43,437 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 14:40:43,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 173 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=500, Invalid=2922, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 14:40:43,439 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:40:43,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 84 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:40:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 14:40:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 14:40:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 14:40:43,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2022-12-14 14:40:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:40:43,440 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 14:40:43,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 14:40:43,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 14:40:43,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 14:40:43,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:40:43,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:40:43,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 14:40:51,904 INFO L899 garLoopResultBuilder]: For program point L663(lines 663 679) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L895 garLoopResultBuilder]: At program point L69(lines 69 77) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~c1_pc~0) (= ~d~0 0) (<= ~wb_st~0 2) (= ~p_in~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= ~c1_i~0 1) (= ~r_i~0 0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~data~0 0) (<= ~t_b~0 0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (= ~c_t~0 0) (<= 0 ~c2_st~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~wl_st~0 1) (= ~c_req_up~0 0) (= ~c~0 0) (= ~e_g~0 2) (= ~r_st~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (= ~e_c~0 2) (= ~e_f~0 2) (= ~e_wl~0 2) (<= 0 ~wb_st~0) (= ~p_out~0 0) (<= 0 ~c1_st~0) (= ~wl_pc~0 1) (= |#NULL.offset| 0) (<= ~c2_st~0 2) (<= ~c2_i~0 1) (= ~wb_i~0 1) (<= ~c2_pc~0 1) (= ~e_p_in~0 0) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (= ~e_e~0 2) (= |#NULL.base| 0)) [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 314) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L895 garLoopResultBuilder]: At program point L269(lines 261 278) the Hoare annotation is: false [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 678) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L305(lines 305 313) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L669(lines 669 677) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L473(lines 402 686) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 312) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L308-1(lines 294 392) no Hoare annotation was computed. [2022-12-14 14:40:51,905 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 676) no Hoare annotation was computed. [2022-12-14 14:40:51,906 INFO L895 garLoopResultBuilder]: At program point L672-1(lines 541 681) the Hoare annotation is: (let ((.cse42 (<= 2 ~e_e~0)) (.cse43 (<= 0 ~wb_pc~0)) (.cse44 (<= 0 ~t_b~0)) (.cse45 (<= 0 ~e_wl~0)) (.cse46 (<= 0 ~data~0)) (.cse47 (<= 0 |#NULL.base|)) (.cse48 (<= 0 ~c1_pc~0)) (.cse49 (<= ~wb_i~0 1)) (.cse50 (<= 0 ~d~0)) (.cse52 (<= 0 ~c_t~0)) (.cse53 (<= ~wb_st~0 2)) (.cse54 (<= ~p_out~0 0)) (.cse55 (<= ~c1_i~0 1)) (.cse56 (<= 1 ~wb_i~0)) (.cse57 (<= 0 ~wl_st~0)) (.cse58 (<= 0 ~c2_pc~0)) (.cse59 (<= 1 ~c1_i~0)) (.cse60 (<= ~c1_pc~0 1)) (.cse61 (<= 0 ~e_p_in~0)) (.cse3 (= ~c1_st~0 0))) (let ((.cse0 (= ~c2_st~0 0)) (.cse16 (= 3 |ULTIMATE.start_start_simulation_~kernel_st~0#1|)) (.cse51 (not .cse3)) (.cse4 (<= ~t_b~0 0)) (.cse5 (<= 0 ~c~0)) (.cse6 (<= 0 ~r_st~0)) (.cse7 (<= 1 ~wl_i~0)) (.cse8 (<= ~wl_st~0 0)) (.cse9 (<= 0 ~processed~0)) (.cse10 (<= ~e_c~0 2)) (.cse11 (<= 0 ~p_in~0)) (.cse12 (<= |#NULL.offset| 0)) (.cse13 (<= ~e_wl~0 2)) (.cse14 (<= 0 ~c2_st~0)) (.cse15 (let ((.cse63 (<= 3 |ULTIMATE.start_start_simulation_~kernel_st~0#1|))) (or (and .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54 (<= ~r_st~0 0) .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse63 (<= 2 ~e_c~0)) (and .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 (<= 2 ~r_st~0) .cse63)))) (.cse17 (<= ~e_e~0 2)) (.cse18 (<= ~wb_pc~0 1)) (.cse19 (<= 1 ~c2_i~0)) (.cse20 (<= ~e_g~0 2)) (.cse21 (<= 0 ~r_i~0)) (.cse1 (= ~e_f~0 2)) (.cse22 (<= 0 ~c_req_up~0)) (.cse23 (<= |#NULL.base| 0)) (.cse24 (<= 0 ~wb_st~0)) (.cse25 (<= 1 ~e_c~0)) (.cse26 (<= ~d~0 0)) (.cse27 (<= ~c_req_up~0 1)) (.cse28 (<= 0 ~c1_st~0)) (.cse29 (<= ~c2_st~0 2)) (.cse30 (<= 2 ~e_g~0)) (.cse31 (<= 0 |#NULL.offset|)) (.cse32 (<= 0 ~p_out~0)) (.cse62 (= 2 ~wl_pc~0)) (.cse33 (<= ~c2_i~0 1)) (.cse34 (<= ~p_in~0 0)) (.cse35 (<= ~c2_pc~0 1)) (.cse36 (<= ~r_st~0 2)) (.cse37 (<= ~wl_i~0 1)) (.cse38 (<= 0 |#StackHeapBarrier|)) (.cse39 (<= ~c1_st~0 2)) (.cse40 (<= ~e_p_in~0 0)) (.cse41 (<= ~r_i~0 0))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= 0 ~wl_st~0) (= (select |#length| 3) 12) (= ~d~0 0) (= ~p_in~0 0) .cse0 (= ~c2_pc~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~r_i~0 0) (= ~c1_pc~0 0) (= ~t_b~0 0) (= ~data~0 0) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~c_t~0 0) (= ~c_req_up~0 0) (= ~c~0 0) (= ~e_g~0 2) (= ~wb_pc~0 0) (= ~r_st~0 2) (= ~e_c~0 2) (= (select |#valid| 1) 1) .cse1 (= ~e_wl~0 2) (= ~c2_i~0 ~wb_i~0) (= (select |#valid| 0) 0) (= ~p_out~0 0) (= ~processed~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse2 0) 48) .cse3 (= 0 ~wl_pc~0) (= (select .cse2 1) 0) (= ~c1_i~0 ~c2_i~0) (= ~wb_st~0 0) (= ~wb_i~0 1) (= ~e_p_in~0 0) (= ~c1_i~0 ~wl_i~0) (= ~e_e~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and (<= 2 ~e_f~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= ~e_f~0 2) .cse26 .cse27 .cse28 (= ~wl_pc~0 1) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse42 .cse43 (<= ~wl_st~0 2) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 (not .cse0) .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse1 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse62 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse51 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse1 .cse22 .cse23 .cse24 .cse25 .cse26 (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 3) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse62 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)))) [2022-12-14 14:40:51,906 INFO L895 garLoopResultBuilder]: At program point L79(lines 65 131) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (<= 0 ~wb_pc~0) (<= 0 ~c1_pc~0) (= ~d~0 0) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (= ~p_in~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= ~c1_i~0 1) (= ~r_i~0 0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (= ~t_b~0 0) (<= ~c1_pc~0 1) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~data~0 0) (<= 0 ~c~0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= 0 ~c2_st~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~wl_st~0 1) (= ~c_req_up~0 0) (= ~e_g~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (= ~e_c~0 2) (<= ~c~0 0) (= ~e_f~0 2) (= ~e_wl~0 2) (<= 0 ~wb_st~0) (<= ~c_t~0 0) (= ~p_out~0 0) (<= 0 ~c1_st~0) (= |#NULL.offset| 0) (<= ~c2_st~0 2) (<= 2 ~r_st~0) (= 0 ~wl_pc~0) (<= ~c2_i~0 1) (= ~wb_i~0 1) (<= ~c2_pc~0 1) (= ~e_p_in~0 0) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (= ~e_e~0 2) (= |#NULL.base| 0)) [2022-12-14 14:40:51,907 INFO L895 garLoopResultBuilder]: At program point L377(lines 294 392) the Hoare annotation is: (let ((.cse0 (<= 2 ~e_e~0)) (.cse6 (<= 0 |#NULL.base|)) (.cse8 (<= ~wb_i~0 1)) (.cse9 (<= 0 ~d~0)) (.cse12 (<= ~p_out~0 0)) (.cse14 (<= 1 ~wb_i~0)) (.cse18 (<= 0 ~e_p_in~0)) (.cse22 (<= ~e_c~0 2)) (.cse23 (<= 0 ~p_in~0)) (.cse24 (<= |#NULL.offset| 0)) (.cse29 (<= ~e_e~0 2)) (.cse32 (<= ~e_g~0 2)) (.cse33 (<= 0 ~r_i~0)) (.cse35 (<= |#NULL.base| 0)) (.cse37 (<= ~d~0 0)) (.cse41 (<= 2 ~e_g~0)) (.cse42 (<= 0 |#NULL.offset|)) (.cse43 (<= 0 ~p_out~0)) (.cse45 (<= ~p_in~0 0)) (.cse49 (<= 2 ~e_c~0)) (.cse51 (<= ~e_p_in~0 0)) (.cse52 (<= ~r_i~0 0)) (.cse57 (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648))) (.cse60 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647)) (.cse61 (= 2 ~wl_st~0)) (.cse53 (not (= ~c1_st~0 0))) (.cse56 (= 2 ~wl_pc~0)) (.cse1 (= 0 ~wl_st~0)) (.cse2 (<= 0 ~wb_pc~0)) (.cse3 (<= 0 ~t_b~0)) (.cse4 (<= 0 ~e_wl~0)) (.cse5 (<= 0 ~data~0)) (.cse7 (<= 0 ~c1_pc~0)) (.cse58 (= ~d~0 0)) (.cse10 (<= 0 ~c_t~0)) (.cse11 (<= ~wb_st~0 2)) (.cse59 (= ~p_in~0 0)) (.cse13 (<= ~c1_i~0 1)) (.cse62 (= ~r_i~0 0)) (.cse15 (<= 0 ~c2_pc~0)) (.cse16 (<= 1 ~c1_i~0)) (.cse17 (<= ~c1_pc~0 1)) (.cse54 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse19 (<= ~t_b~0 0)) (.cse20 (<= 1 ~wl_i~0)) (.cse21 (<= 0 ~processed~0)) (.cse25 (<= ~e_wl~0 2)) (.cse26 (<= 0 ~c2_st~0)) (.cse27 (= ~c~0 0)) (.cse63 (= ~e_g~0 2)) (.cse28 (= ~r_st~0 2)) (.cse30 (<= ~wb_pc~0 1)) (.cse31 (<= 1 ~c2_i~0)) (.cse64 (= ~e_c~0 2)) (.cse55 (= ~e_f~0 2)) (.cse34 (<= 0 ~c_req_up~0)) (.cse36 (<= 0 ~wb_st~0)) (.cse38 (<= ~c_req_up~0 1)) (.cse65 (= ~p_out~0 0)) (.cse39 (<= 0 ~c1_st~0)) (.cse66 (= |#NULL.offset| 0)) (.cse40 (<= ~c2_st~0 2)) (.cse44 (<= ~c2_i~0 1)) (.cse67 (= ~wb_i~0 1)) (.cse46 (<= ~c2_pc~0 1)) (.cse68 (= ~e_p_in~0 0)) (.cse47 (<= ~wl_i~0 1)) (.cse48 (<= 0 |#StackHeapBarrier|)) (.cse50 (<= ~c1_st~0 2)) (.cse69 (= ~e_e~0 2)) (.cse70 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~e_f~0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= ~e_f~0 2) .cse37 .cse38 .cse39 .cse40 .cse41 (= 0 ~wl_pc~0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse2 (<= ~wl_st~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse53 (not (= ~c2_st~0 0)) .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 ~wl_st~0) .cse15 .cse16 .cse17 .cse18 .cse54 .cse19 (<= 0 ~c~0) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse29 .cse30 .cse31 .cse32 .cse33 .cse55 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse56 .cse44 .cse45 .cse46 (<= ~r_st~0 2) .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse57 .cse2 .cse3 .cse5 .cse7 .cse58 .cse10 .cse11 .cse59 (<= 1 ~wl_pc~0) .cse60 .cse61 .cse13 .cse62 .cse15 .cse16 .cse17 .cse54 .cse19 .cse20 .cse21 .cse26 .cse27 .cse63 .cse28 .cse30 (<= ~wl_pc~0 2) .cse31 .cse64 .cse55 .cse34 (= ~e_wl~0 0) .cse36 .cse38 .cse65 .cse39 .cse66 .cse40 .cse44 .cse67 .cse46 .cse68 .cse47 .cse48 .cse50 .cse69 .cse70) (and .cse57 .cse2 .cse3 .cse4 .cse5 .cse7 .cse58 .cse10 .cse11 .cse59 .cse60 .cse61 .cse13 .cse62 .cse15 .cse16 .cse17 .cse54 .cse19 .cse20 .cse21 .cse25 .cse26 .cse27 .cse63 .cse28 .cse30 .cse31 .cse64 .cse55 .cse34 .cse36 .cse38 .cse65 .cse39 .cse66 .cse40 .cse56 .cse44 .cse67 .cse46 .cse68 .cse47 .cse48 .cse50 .cse69 .cse70) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse53 .cse58 .cse10 .cse11 .cse59 .cse13 .cse62 .cse15 .cse16 .cse17 .cse54 .cse19 .cse20 .cse21 .cse25 .cse26 .cse27 .cse63 .cse28 .cse30 .cse31 .cse64 .cse55 .cse34 .cse36 .cse38 .cse65 .cse39 .cse66 .cse40 .cse56 .cse44 .cse67 .cse46 .cse68 .cse47 .cse48 .cse50 .cse69 .cse70) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse58 .cse10 .cse11 .cse59 .cse13 .cse62 .cse15 .cse16 .cse17 .cse54 .cse19 .cse20 .cse21 .cse25 .cse26 .cse27 .cse63 .cse28 .cse30 .cse31 .cse64 .cse55 .cse34 .cse36 .cse38 .cse65 .cse39 (= ~wl_pc~0 1) .cse66 .cse40 .cse44 .cse67 .cse46 .cse68 .cse47 .cse48 .cse50 .cse69 .cse70))) [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point L381(lines 381 388) no Hoare annotation was computed. [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point L580-1(lines 541 681) no Hoare annotation was computed. [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point L317(lines 294 392) no Hoare annotation was computed. [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 125) no Hoare annotation was computed. [2022-12-14 14:40:51,907 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 399 687) the Hoare annotation is: true [2022-12-14 14:40:51,907 INFO L895 garLoopResultBuilder]: At program point L119-2(lines 87 126) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~c1_pc~0) (not (= ~c1_st~0 0)) (= ~d~0 0) (not (= ~c2_st~0 0)) (<= ~wb_st~0 2) (= ~p_in~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= ~c1_i~0 1) (= ~r_i~0 0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~data~0 0) (<= ~t_b~0 0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (= ~c_t~0 0) (<= 0 ~c2_st~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~wl_st~0 1) (= ~c_req_up~0 0) (= ~c~0 0) (= ~e_g~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (= ~e_c~0 2) (= ~e_f~0 2) (= ~e_wl~0 2) (<= 0 ~wb_st~0) (not (= ~wb_st~0 0)) (= ~p_out~0 0) (<= 0 ~c1_st~0) (= ~wl_pc~0 1) (= |#NULL.offset| 0) (<= ~c2_st~0 2) (<= 2 ~r_st~0) (<= ~c2_i~0 1) (= ~wb_i~0 1) (<= ~c2_pc~0 1) (= ~e_p_in~0 0) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (= ~e_e~0 2) (= |#NULL.base| 0)) [2022-12-14 14:40:51,907 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: false [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point L321(lines 321 328) no Hoare annotation was computed. [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-12-14 14:40:51,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 14:40:51,908 INFO L895 garLoopResultBuilder]: At program point $Ultimate##44(lines 473 481) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= 0 ~wl_st~0) (= (select |#length| 3) 12) (= ~d~0 0) (= ~p_in~0 0) (= ~c2_st~0 0) (= ~c2_pc~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~r_i~0 0) (= ~c1_pc~0 0) (= ~t_b~0 0) (= ~data~0 0) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~c_t~0 0) (= ~c_req_up~0 0) (= ~c~0 0) (= ~e_g~0 2) (= ~wb_pc~0 0) (= ~r_st~0 2) (= ~e_c~0 2) (= (select |#valid| 1) 1) (= ~e_f~0 2) (= ~e_wl~0 2) (= ~c2_i~0 ~wb_i~0) (= (select |#valid| 0) 0) (= ~p_out~0 0) (= ~processed~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= ~c1_st~0 0) (= 0 ~wl_pc~0) (= (select .cse0 1) 0) (= ~c1_i~0 ~c2_i~0) (= ~wb_st~0 0) (= ~wb_i~0 1) (= ~e_p_in~0 0) (= ~c1_i~0 ~wl_i~0) (= ~e_e~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 14:40:51,908 INFO L899 garLoopResultBuilder]: For program point L655-1(lines 541 681) no Hoare annotation was computed. [2022-12-14 14:40:51,908 INFO L895 garLoopResultBuilder]: At program point $Ultimate##251(lines 593 601) the Hoare annotation is: (and (<= 2 ~e_e~0) (not (= 0 ~wl_st~0)) (<= 0 ~wb_pc~0) (<= ~wl_st~0 2) (<= 0 ~t_b~0) (<= 0 ~e_wl~0) (<= 0 ~data~0) (<= 0 |#NULL.base|) (<= 0 ~c1_pc~0) (<= ~wb_i~0 1) (<= 0 ~d~0) (not (= ~c1_st~0 0)) (not (= ~c2_st~0 0)) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (<= ~p_out~0 0) (<= ~c1_i~0 1) (<= 1 ~wb_i~0) (<= 0 ~wl_st~0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (<= 0 ~e_p_in~0) (or (and (= ~c_t~0 ~c~0) (= ~c_req_up~0 0) (= ~e_c~0 1)) (and (<= 0 ~c~0) (<= ~e_c~0 2) (not (= ~c_req_up~0 1)) (<= 0 ~c_req_up~0) (<= 2 ~e_c~0))) (<= ~t_b~0 0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= 0 ~p_in~0) (<= |#NULL.offset| 0) (<= ~e_wl~0 2) (<= 0 ~c2_st~0) (= 3 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (<= ~e_e~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (<= ~e_g~0 2) (<= 0 ~r_i~0) (= ~e_f~0 2) (<= |#NULL.base| 0) (<= 0 ~wb_st~0) (<= ~d~0 0) (not (= ~wb_st~0 0)) (not (= ~r_st~0 0)) (<= 0 ~c1_st~0) (not (= ~e_wl~0 0)) (<= ~c2_st~0 2) (<= 2 ~e_g~0) (<= 0 |#NULL.offset|) (<= 0 ~p_out~0) (= 2 ~wl_pc~0) (<= ~c2_i~0 1) (<= ~p_in~0 0) (<= ~c2_pc~0 1) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (<= ~e_p_in~0 0) (<= ~r_i~0 0)) [2022-12-14 14:40:51,908 INFO L895 garLoopResultBuilder]: At program point write_loop_returnLabel#1(lines 62 132) the Hoare annotation is: (let ((.cse0 (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648))) (.cse1 (<= 0 ~wb_pc~0)) (.cse2 (<= 0 ~t_b~0)) (.cse3 (<= 0 ~data~0)) (.cse4 (<= 0 ~c1_pc~0)) (.cse5 (<= ~c_req_up~0 0)) (.cse6 (<= 0 ~c_t~0)) (.cse7 (<= ~wb_st~0 2)) (.cse8 (<= ~p_out~0 0)) (.cse9 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647)) (.cse10 (= 2 ~wl_st~0)) (.cse11 (<= ~c1_i~0 1)) (.cse12 (<= 0 ~c2_pc~0)) (.cse13 (<= 1 ~c1_i~0)) (.cse14 (<= ~c1_pc~0 1)) (.cse15 (<= 0 ~e_p_in~0)) (.cse16 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse17 (<= ~t_b~0 0)) (.cse18 (<= 0 ~c~0)) (.cse19 (<= 1 ~wl_i~0)) (.cse20 (<= 0 ~processed~0)) (.cse21 (<= ~e_c~0 2)) (.cse22 (<= 0 ~p_in~0)) (.cse23 (<= |#NULL.offset| 0)) (.cse24 (<= 0 ~c2_st~0)) (.cse25 (<= ~wb_pc~0 1)) (.cse26 (<= 1 ~c2_i~0)) (.cse27 (<= ~e_g~0 2)) (.cse28 (<= ~data~0 0)) (.cse29 (<= 0 ~r_i~0)) (.cse30 (<= ~c~0 0)) (.cse31 (<= 0 ~c_req_up~0)) (.cse32 (<= 0 ~wb_st~0)) (.cse33 (<= ~c_t~0 0)) (.cse34 (<= 0 ~c1_st~0)) (.cse35 (<= ~c2_st~0 2)) (.cse36 (<= 2 ~e_g~0)) (.cse37 (<= 2 ~r_st~0)) (.cse38 (<= 0 |#NULL.offset|)) (.cse39 (<= 0 ~p_out~0)) (.cse40 (<= ~c2_i~0 1)) (.cse41 (<= ~p_in~0 0)) (.cse42 (<= ~c2_pc~0 1)) (.cse43 (<= ~r_st~0 2)) (.cse44 (<= ~wl_i~0 1)) (.cse45 (<= 0 |#StackHeapBarrier|)) (.cse46 (<= 2 ~e_c~0)) (.cse47 (<= ~c1_st~0 2)) (.cse48 (= ~e_e~0 2)) (.cse49 (<= ~e_p_in~0 0)) (.cse50 (= |#NULL.base| 0)) (.cse51 (<= ~r_i~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~wb_i~0 1) (<= 0 ~d~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ~wb_i~0) .cse12 .cse13 .cse14 .cse15 .cse16 (<= 2 ~e_f~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= ~e_wl~0 0) .cse32 (<= ~e_f~0 2) (<= ~d~0 0) .cse33 .cse34 (= ~wl_pc~0 1) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 (<= 0 ~e_wl~0) .cse3 .cse4 .cse5 (= ~d~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= ~e_wl~0 2) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= ~e_f~0 2) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= 2 ~wl_pc~0) .cse40 .cse41 (= ~wb_i~0 1) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-12-14 14:40:51,908 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 14:40:51,908 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 278) no Hoare annotation was computed. [2022-12-14 14:40:51,908 INFO L899 garLoopResultBuilder]: For program point L460-1(lines 402 686) no Hoare annotation was computed. [2022-12-14 14:40:51,908 INFO L899 garLoopResultBuilder]: For program point L295(lines 294 392) no Hoare annotation was computed. [2022-12-14 14:40:51,908 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 266) no Hoare annotation was computed. [2022-12-14 14:40:51,909 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 285 398) the Hoare annotation is: (let ((.cse22 (not (= ~wb_st~0 0))) (.cse0 (<= 0 ~wb_pc~0)) (.cse1 (<= 0 ~t_b~0)) (.cse2 (<= 0 ~data~0)) (.cse3 (<= 0 ~c1_pc~0)) (.cse4 (not (= ~c1_st~0 0))) (.cse5 (not (= ~c2_st~0 0))) (.cse6 (<= 0 ~c_t~0)) (.cse7 (<= ~wb_st~0 2)) (.cse8 (<= ~c1_i~0 1)) (.cse9 (<= 0 ~c2_pc~0)) (.cse10 (<= 1 ~c1_i~0)) (.cse11 (<= ~c1_pc~0 1)) (.cse12 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse13 (<= ~t_b~0 0)) (.cse14 (<= 1 ~wl_i~0)) (.cse15 (<= 0 ~processed~0)) (.cse16 (<= 0 ~c2_st~0)) (.cse17 (<= ~wb_pc~0 1)) (.cse18 (<= 1 ~c2_i~0)) (.cse19 (= ~e_f~0 2)) (.cse20 (<= 0 ~c_req_up~0)) (.cse21 (<= 0 ~wb_st~0)) (.cse23 (<= 0 ~c1_st~0)) (.cse24 (<= ~c2_st~0 2)) (.cse25 (<= ~c2_i~0 1)) (.cse26 (<= ~c2_pc~0 1)) (.cse27 (<= ~wl_i~0 1)) (.cse28 (<= 0 |#StackHeapBarrier|)) (.cse29 (<= ~c1_st~0 2))) (or (and (<= 2 ~e_e~0) (not (= 0 ~wl_st~0)) .cse0 (<= ~wl_st~0 2) .cse1 (<= 0 ~e_wl~0) .cse2 (<= 0 |#NULL.base|) .cse3 (<= ~wb_i~0 1) (<= 0 ~d~0) .cse4 .cse5 .cse6 .cse7 (<= ~p_out~0 0) .cse8 (<= 1 ~wb_i~0) (<= 0 ~wl_st~0) .cse9 .cse10 .cse11 (<= 0 ~e_p_in~0) .cse12 .cse13 (<= 0 ~c~0) .cse14 .cse15 (<= ~e_c~0 2) (<= 0 ~p_in~0) (<= |#NULL.offset| 0) (<= ~e_wl~0 2) .cse16 (<= ~e_e~0 2) .cse17 .cse18 (<= ~e_g~0 2) (<= 0 ~r_i~0) .cse19 .cse20 (<= |#NULL.base| 0) .cse21 (<= ~d~0 0) .cse22 (not (= ~r_st~0 0)) .cse23 .cse24 (<= 2 ~e_g~0) (<= 0 |#NULL.offset|) (<= 0 ~p_out~0) (= 2 ~wl_pc~0) .cse25 (<= ~p_in~0 0) .cse26 (<= ~r_st~0 2) .cse27 .cse28 (<= 2 ~e_c~0) .cse29 (<= ~e_p_in~0 0) (<= ~r_i~0 0)) (and .cse22 (let ((.cse30 (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648))) (.cse31 (= ~d~0 0)) (.cse32 (= ~p_in~0 0)) (.cse33 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647)) (.cse34 (= 2 ~wl_st~0)) (.cse35 (= ~r_i~0 0)) (.cse36 (= ~c~0 0)) (.cse37 (= ~e_g~0 2)) (.cse38 (= ~r_st~0 2)) (.cse39 (= ~e_c~0 2)) (.cse40 (<= ~c_req_up~0 1)) (.cse41 (= ~p_out~0 0)) (.cse42 (= |#NULL.offset| 0)) (.cse43 (= ~wb_i~0 1)) (.cse44 (= ~e_p_in~0 0)) (.cse45 (= ~e_e~0 2)) (.cse46 (= |#NULL.base| 0))) (or (and .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse32 (<= 1 ~wl_pc~0) .cse33 .cse34 .cse8 .cse35 (= ~e_wl~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse36 .cse37 .cse38 .cse17 (<= ~wl_pc~0 2) .cse18 .cse39 .cse19 .cse20 .cse21 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse30 .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse32 .cse33 .cse34 .cse8 .cse35 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse36 .cse37 .cse38 .cse17 .cse18 .cse39 .cse19 .cse20 (= ~e_wl~0 0) .cse21 .cse40 .cse41 (= ~wl_pc~0 1) .cse42 .cse43 .cse44 .cse45 .cse46))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) [2022-12-14 14:40:51,909 INFO L899 garLoopResultBuilder]: For program point L593(lines 541 681) no Hoare annotation was computed. [2022-12-14 14:40:51,909 INFO L899 garLoopResultBuilder]: For program point L362(lines 294 392) no Hoare annotation was computed. [2022-12-14 14:40:51,909 INFO L895 garLoopResultBuilder]: At program point $Ultimate##216(lines 269 277) the Hoare annotation is: false [2022-12-14 14:40:51,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2022-12-14 14:40:51,909 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 78) no Hoare annotation was computed. [2022-12-14 14:40:51,909 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 315) no Hoare annotation was computed. [2022-12-14 14:40:51,911 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:40:51,913 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 14:40:51,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:40:51 BoogieIcfgContainer [2022-12-14 14:40:51,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 14:40:51,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 14:40:51,942 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 14:40:51,942 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 14:40:51,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:28:50" (3/4) ... [2022-12-14 14:40:51,945 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 14:40:51,955 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2022-12-14 14:40:51,955 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-12-14 14:40:51,956 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 14:40:51,956 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 14:40:52,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 14:40:52,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 14:40:52,000 INFO L158 Benchmark]: Toolchain (without parser) took 722425.82ms. Allocated memory was 127.9MB in the beginning and 1.1GB in the end (delta: 924.8MB). Free memory was 88.6MB in the beginning and 355.4MB in the end (delta: -266.8MB). Peak memory consumption was 660.2MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,000 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 98.6MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:40:52,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.23ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 73.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.89ms. Allocated memory is still 127.9MB. Free memory was 73.9MB in the beginning and 71.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,001 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 127.9MB. Free memory was 71.4MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,001 INFO L158 Benchmark]: RCFGBuilder took 657.53ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 69.3MB in the beginning and 62.8MB in the end (delta: 6.5MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,001 INFO L158 Benchmark]: TraceAbstraction took 721374.30ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 897.6MB). Free memory was 61.7MB in the beginning and 362.8MB in the end (delta: -301.1MB). Peak memory consumption was 740.6MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,001 INFO L158 Benchmark]: Witness Printer took 57.66ms. Allocated memory is still 1.1GB. Free memory was 362.8MB in the beginning and 355.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 14:40:52,002 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.12ms. Allocated memory is still 98.6MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.23ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 73.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.89ms. Allocated memory is still 127.9MB. Free memory was 73.9MB in the beginning and 71.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 127.9MB. Free memory was 71.4MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 657.53ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 69.3MB in the beginning and 62.8MB in the end (delta: 6.5MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 721374.30ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 897.6MB). Free memory was 61.7MB in the beginning and 362.8MB in the end (delta: -301.1MB). Peak memory consumption was 740.6MB. Max. memory is 16.1GB. * Witness Printer took 57.66ms. Allocated memory is still 1.1GB. Free memory was 362.8MB in the beginning and 355.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 721.3s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 1354 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3033 IncrementalHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 553 mSDtfsCounter, 3033 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 764 GetRequests, 572 SyntacticMatches, 11 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3832 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=9, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 294 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 58 NumberOfFragments, 3397 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1955 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 13 FomulaSimplificationsInter, 10624 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 884 NumberOfCodeBlocks, 884 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1042 ConstructedInterpolants, 0 QuantifiedInterpolants, 5841 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1259 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 589/783 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: OVERALL_TIME: 682.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 271, DAG_INTERPRETER_EARLY_EXITS: 50, TOOLS_POST_APPLICATIONS: 1691, TOOLS_POST_TIME: 628.5s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1053, TOOLS_QUANTIFIERELIM_TIME: 628.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 105.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 2093, FLUID_YES_ANSWERS: 44, DOMAIN_JOIN_APPLICATIONS: 144, DOMAIN_JOIN_TIME: 9.0s, DOMAIN_ALPHA_APPLICATIONS: 44, DOMAIN_ALPHA_TIME: 37.5s, DOMAIN_WIDEN_APPLICATIONS: 16, DOMAIN_WIDEN_TIME: 0.8s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 117, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 271, DOMAIN_ISBOTTOM_TIME: 0.5s, LOOP_SUMMARIZER_APPLICATIONS: 101, LOOP_SUMMARIZER_CACHE_MISSES: 101, LOOP_SUMMARIZER_OVERALL_TIME: 558.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 558.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 117, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 5.5s, DAG_COMPRESSION_PROCESSED_NODES: 188925, DAG_COMPRESSION_RETAINED_NODES: 794, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= e_e && !(0 == wl_st)) && 0 <= wb_pc) && wl_st <= 2) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && !(c1_st == 0)) && !(c2_st == 0)) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && kernel_st == 1) && t_b <= 0) && 0 <= c) && 1 <= wl_i) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && e_f == 2) && 0 <= c_req_up) && #NULL <= 0) && 0 <= wb_st) && d <= 0) && !(wb_st == 0)) && !(r_st == 0)) && 0 <= c1_st) && c2_st <= 2) && 2 <= e_g) && 0 <= #NULL) && 0 <= p_out) && 2 == wl_pc) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= e_c) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0) || ((((((((!(wb_st == 0) && ((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= data) && 0 <= c1_pc) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && 1 <= wl_pc) && tmp <= 2147483647) && 2 == wl_st) && c1_i <= 1) && r_i == 0) && e_wl == 1) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && 0 <= c2_st) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && wl_pc <= 2) && 1 <= c2_i) && e_c == 2) && e_f == 2) && 0 <= c_req_up) && 0 <= wb_st) && c_req_up <= 1) && p_out == 0) && #NULL == 0) && wb_i == 1) && e_p_in == 0) && e_e == 2) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= data) && 0 <= c1_pc) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && tmp <= 2147483647) && 2 == wl_st) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && 0 <= c2_st) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && e_f == 2) && 0 <= c_req_up) && e_wl == 0) && 0 <= wb_st) && c_req_up <= 1) && p_out == 0) && wl_pc == 1) && #NULL == 0) && wb_i == 1) && e_p_in == 0) && e_e == 2) && #NULL == 0))) && 0 <= c1_st) && c2_st <= 2) && c2_i <= 1) && c2_pc <= 1) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= e_e && !(0 == wl_st)) && 0 <= wb_pc) && wl_st <= 2) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && !(c1_st == 0)) && !(c2_st == 0)) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && (((c_t == c && c_req_up == 0) && e_c == 1) || ((((0 <= c && e_c <= 2) && !(c_req_up == 1)) && 0 <= c_req_up) && 2 <= e_c))) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && 3 == kernel_st) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && e_f == 2) && #NULL <= 0) && 0 <= wb_st) && d <= 0) && !(wb_st == 0)) && !(r_st == 0)) && 0 <= c1_st) && !(e_wl == 0)) && c2_st <= 2) && 2 <= e_g) && 0 <= #NULL) && 0 <= p_out) && 2 == wl_pc) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= c1_pc) && d == 0) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && tmp <= 2147483647) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && t_b == 0) && c1_pc <= 1) && kernel_st == 1) && data == 0) && 0 <= c) && 1 <= wl_i) && 0 <= processed) && 0 <= c2_st) && !(tmp == 0)) && wl_st == 1) && c_req_up == 0) && e_g == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && c <= 0) && e_f == 2) && e_wl == 2) && 0 <= wb_st) && c_t <= 0) && p_out == 0) && 0 <= c1_st) && #NULL == 0) && c2_st <= 2) && 2 <= r_st) && 0 == wl_pc) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= data) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && c_req_up <= 0) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && tmp <= 2147483647) && 2 == wl_st) && c1_i <= 1) && 1 <= wb_i) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && kernel_st == 1) && 2 <= e_f) && t_b <= 0) && 0 <= c) && 1 <= wl_i) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && 0 <= c2_st) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && data <= 0) && 0 <= r_i) && c <= 0) && 0 <= c_req_up) && e_wl == 0) && 0 <= wb_st) && e_f <= 2) && d <= 0) && c_t <= 0) && 0 <= c1_st) && wl_pc == 1) && c2_st <= 2) && 2 <= e_g) && 2 <= r_st) && 0 <= #NULL) && 0 <= p_out) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= e_c) && c1_st <= 2) && e_e == 2) && e_p_in <= 0) && #NULL == 0) && r_i <= 0) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= c1_pc) && c_req_up <= 0) && d == 0) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && tmp <= 2147483647) && 2 == wl_st) && c1_i <= 1) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && kernel_st == 1) && t_b <= 0) && 0 <= c) && 1 <= wl_i) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && data <= 0) && 0 <= r_i) && c <= 0) && e_f == 2) && 0 <= c_req_up) && 0 <= wb_st) && c_t <= 0) && 0 <= c1_st) && c2_st <= 2) && 2 <= e_g) && 2 <= r_st) && 0 <= #NULL) && 0 <= p_out) && 2 == wl_pc) && c2_i <= 1) && p_in <= 0) && wb_i == 1) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= e_c) && c1_st <= 2) && e_e == 2) && e_p_in <= 0) && #NULL == 0) && r_i <= 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= c1_pc) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_st <= 2) && p_in == 0) && tmp <= 2147483647) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && data == 0) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && c_t == 0) && 0 <= c2_st) && !(tmp == 0)) && wl_st == 1) && c_req_up == 0) && c == 0) && e_g == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && e_f == 2) && e_wl == 2) && 0 <= wb_st) && !(wb_st == 0)) && p_out == 0) && 0 <= c1_st) && wl_pc == 1) && #NULL == 0) && c2_st <= 2) && 2 <= r_st) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0 - InvariantResult [Line: 541]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((0 == wl_st && unknown-#length-unknown[3] == 12) && d == 0) && p_in == 0) && c2_st == 0) && c2_pc == 0) && kernel_st == 0) && r_i == 0) && c1_pc == 0) && t_b == 0) && data == 0) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && c_t == 0) && c_req_up == 0) && c == 0) && e_g == 2) && wb_pc == 0) && r_st == 2) && e_c == 2) && \valid[1] == 1) && e_f == 2) && e_wl == 2) && c2_i == wb_i) && \valid[0] == 0) && p_out == 0) && processed == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && c1_st == 0) && 0 == wl_pc) && unknown-#memory_int-unknown[1][1] == 0) && c1_i == c2_i) && wb_st == 0) && wb_i == 1) && e_p_in == 0) && c1_i == wl_i) && e_e == 2) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((2 <= e_f && t_b <= 0) && 0 <= c) && 0 <= r_st) && 1 <= wl_i) && wl_st <= 0) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && ((((((((((((((((((((((2 <= e_e && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && r_st <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && 3 <= kernel_st) && 2 <= e_c) || ((((((((((((((((((((2 <= e_e && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && 2 <= r_st) && 3 <= kernel_st))) && 3 == kernel_st) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && 0 <= c_req_up) && #NULL <= 0) && 0 <= wb_st) && 1 <= e_c) && e_f <= 2) && d <= 0) && c_req_up <= 1) && 0 <= c1_st) && wl_pc == 1) && c2_st <= 2) && 2 <= e_g) && 0 <= #NULL) && 0 <= p_out) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= e_e && 0 <= wb_pc) && wl_st <= 2) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && !(c1_st == 0)) && !(c2_st == 0)) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && t_b <= 0) && 0 <= c) && 1 <= wl_i) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && 3 == kernel_st) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && e_f == 2) && 0 <= c_req_up) && #NULL <= 0) && 0 <= wb_st) && 1 <= e_c) && d <= 0) && 0 <= c1_st) && c2_st <= 2) && 2 <= e_g) && 0 <= #NULL) && 0 <= p_out) && 2 == wl_pc) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0)) || ((((((((((((((((((((((((((((((((((((((((!(c1_st == 0) && t_b <= 0) && 0 <= c) && 0 <= r_st) && 1 <= wl_i) && wl_st <= 0) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && ((((((((((((((((((((((2 <= e_e && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && r_st <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && 3 <= kernel_st) && 2 <= e_c) || ((((((((((((((((((((2 <= e_e && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && 2 <= r_st) && 3 <= kernel_st))) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && e_f == 2) && 0 <= c_req_up) && #NULL <= 0) && 0 <= wb_st) && 1 <= e_c) && d <= 0) && kernel_st <= 3) && c_req_up <= 1) && 0 <= c1_st) && c2_st <= 2) && 2 <= e_g) && 0 <= #NULL) && 0 <= p_out) && 2 == wl_pc) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((0 == wl_st && unknown-#length-unknown[3] == 12) && d == 0) && p_in == 0) && c2_st == 0) && c2_pc == 0) && kernel_st == 0) && r_i == 0) && c1_pc == 0) && t_b == 0) && data == 0) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && c_t == 0) && c_req_up == 0) && c == 0) && e_g == 2) && wb_pc == 0) && r_st == 2) && e_c == 2) && \valid[1] == 1) && e_f == 2) && e_wl == 2) && c2_i == wb_i) && \valid[0] == 0) && p_out == 0) && processed == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && c1_st == 0) && 0 == wl_pc) && unknown-#memory_int-unknown[1][1] == 0) && c1_i == c2_i) && wb_st == 0) && wb_i == 1) && e_p_in == 0) && c1_i == wl_i) && e_e == 2) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= e_e && 0 == wl_st) && 1 <= kernel_st) && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && kernel_st <= 1) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && 2 <= e_f) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && c == 0) && r_st == 2) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && 0 <= c_req_up) && #NULL <= 0) && 0 <= wb_st) && e_f <= 2) && d <= 0) && c_req_up <= 1) && 0 <= c1_st) && c2_st <= 2) && 2 <= e_g) && 0 == wl_pc) && 0 <= #NULL) && 0 <= p_out) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= e_c) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 <= e_e && 0 <= wb_pc) && wl_st <= 2) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= #NULL) && 0 <= c1_pc) && wb_i <= 1) && 0 <= d) && !(c1_st == 0)) && !(c2_st == 0)) && 0 <= c_t) && wb_st <= 2) && p_out <= 0) && c1_i <= 1) && 1 <= wb_i) && 0 <= wl_st) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && 0 <= e_p_in) && kernel_st == 1) && t_b <= 0) && 0 <= c) && 1 <= wl_i) && 0 <= processed) && e_c <= 2) && 0 <= p_in) && #NULL <= 0) && e_wl <= 2) && 0 <= c2_st) && e_e <= 2) && wb_pc <= 1) && 1 <= c2_i) && e_g <= 2) && 0 <= r_i) && e_f == 2) && 0 <= c_req_up) && #NULL <= 0) && 0 <= wb_st) && d <= 0) && 0 <= c1_st) && c2_st <= 2) && 2 <= e_g) && 0 <= #NULL) && 0 <= p_out) && 2 == wl_pc) && c2_i <= 1) && p_in <= 0) && c2_pc <= 1) && r_st <= 2) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= e_c) && c1_st <= 2) && e_p_in <= 0) && r_i <= 0)) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= data) && 0 <= c1_pc) && d == 0) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && 1 <= wl_pc) && tmp <= 2147483647) && 2 == wl_st) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && 0 <= c2_st) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && wl_pc <= 2) && 1 <= c2_i) && e_c == 2) && e_f == 2) && 0 <= c_req_up) && e_wl == 0) && 0 <= wb_st) && c_req_up <= 1) && p_out == 0) && 0 <= c1_st) && #NULL == 0) && c2_st <= 2) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= c1_pc) && d == 0) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && tmp <= 2147483647) && 2 == wl_st) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && e_wl <= 2) && 0 <= c2_st) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && e_f == 2) && 0 <= c_req_up) && 0 <= wb_st) && c_req_up <= 1) && p_out == 0) && 0 <= c1_st) && #NULL == 0) && c2_st <= 2) && 2 == wl_pc) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((((0 == wl_st && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= c1_pc) && !(c1_st == 0)) && d == 0) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && e_wl <= 2) && 0 <= c2_st) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && e_f == 2) && 0 <= c_req_up) && 0 <= wb_st) && c_req_up <= 1) && p_out == 0) && 0 <= c1_st) && #NULL == 0) && c2_st <= 2) && 2 == wl_pc) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((((((0 == wl_st && 0 <= wb_pc) && 0 <= t_b) && 0 <= e_wl) && 0 <= data) && 0 <= c1_pc) && d == 0) && 0 <= c_t) && wb_st <= 2) && p_in == 0) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && e_wl <= 2) && 0 <= c2_st) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && e_f == 2) && 0 <= c_req_up) && 0 <= wb_st) && c_req_up <= 1) && p_out == 0) && 0 <= c1_st) && wl_pc == 1) && #NULL == 0) && c2_st <= 2) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && 0 <= wb_pc) && 0 <= t_b) && 0 <= c1_pc) && d == 0) && wb_st <= 2) && p_in == 0) && tmp <= 2147483647) && c1_i <= 1) && r_i == 0) && 0 <= c2_pc) && 1 <= c1_i) && c1_pc <= 1) && kernel_st == 1) && data == 0) && t_b <= 0) && 1 <= wl_i) && 0 <= processed) && c_t == 0) && 0 <= c2_st) && !(tmp == 0)) && wl_st == 1) && c_req_up == 0) && c == 0) && e_g == 2) && r_st == 2) && wb_pc <= 1) && 1 <= c2_i) && e_c == 2) && e_f == 2) && e_wl == 2) && 0 <= wb_st) && p_out == 0) && 0 <= c1_st) && wl_pc == 1) && #NULL == 0) && c2_st <= 2) && c2_i <= 1) && wb_i == 1) && c2_pc <= 1) && e_p_in == 0) && wl_i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && c1_st <= 2) && e_e == 2) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-12-14 14:40:52,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbe010ba-987b-4cff-a7c3-dd28ac460ef9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE