./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b54c9d2adb9e977f0950bab67988d354292e80fb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:30:43,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:30:43,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:30:43,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:30:43,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:30:43,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:30:43,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:30:43,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:30:43,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:30:43,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:30:43,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:30:43,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:30:43,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:30:43,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:30:43,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:30:43,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:30:43,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:30:43,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:30:43,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:30:43,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:30:43,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:30:43,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:30:43,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:30:43,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:30:43,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:30:43,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:30:43,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:30:43,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:30:43,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:30:43,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:30:43,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:30:43,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:30:43,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:30:43,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:30:43,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:30:43,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:30:43,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:30:43,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:30:43,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:30:43,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:30:43,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:30:43,991 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:30:44,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:30:44,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:30:44,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:30:44,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:30:44,023 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:30:44,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:30:44,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:30:44,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:30:44,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:30:44,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:30:44,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:30:44,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:30:44,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:30:44,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:30:44,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:30:44,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:30:44,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:30:44,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:30:44,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:30:44,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:30:44,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:30:44,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:30:44,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:30:44,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:30:44,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:30:44,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:30:44,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:30:44,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:30:44,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> b54c9d2adb9e977f0950bab67988d354292e80fb [2019-11-20 05:30:44,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:30:44,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:30:44,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:30:44,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:30:44,193 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:30:44,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2019-11-20 05:30:44,254 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/data/3b71ce662/3b50c08f838544c3b7b8deb45c42e499/FLAGca43e8413 [2019-11-20 05:30:44,594 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:30:44,595 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2019-11-20 05:30:44,599 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/data/3b71ce662/3b50c08f838544c3b7b8deb45c42e499/FLAGca43e8413 [2019-11-20 05:30:44,985 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/data/3b71ce662/3b50c08f838544c3b7b8deb45c42e499 [2019-11-20 05:30:44,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:30:44,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:30:44,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:30:44,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:30:44,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:30:44,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:44" (1/1) ... [2019-11-20 05:30:44,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4552a949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:44, skipping insertion in model container [2019-11-20 05:30:44,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:44" (1/1) ... [2019-11-20 05:30:45,005 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:30:45,020 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:30:45,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:30:45,161 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:30:45,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:30:45,251 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:30:45,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45 WrapperNode [2019-11-20 05:30:45,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:30:45,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:30:45,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:30:45,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:30:45,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:30:45,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:30:45,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:30:45,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:30:45,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... [2019-11-20 05:30:45,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:30:45,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:30:45,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:30:45,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:30:45,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:30:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:30:45,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:30:45,708 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:30:45,709 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 05:30:45,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:45 BoogieIcfgContainer [2019-11-20 05:30:45,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:30:45,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:30:45,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:30:45,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:30:45,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:30:44" (1/3) ... [2019-11-20 05:30:45,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78424df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:45, skipping insertion in model container [2019-11-20 05:30:45,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:45" (2/3) ... [2019-11-20 05:30:45,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78424df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:45, skipping insertion in model container [2019-11-20 05:30:45,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:45" (3/3) ... [2019-11-20 05:30:45,723 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2019-11-20 05:30:45,732 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:30:45,740 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:30:45,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:30:45,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:30:45,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:30:45,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:30:45,781 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:30:45,781 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:30:45,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:30:45,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:30:45,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:30:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-20 05:30:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:30:45,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:45,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:45,809 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash -265415979, now seen corresponding path program 1 times [2019-11-20 05:30:45,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:45,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337294660] [2019-11-20 05:30:45,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:45,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337294660] [2019-11-20 05:30:45,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:30:45,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:30:45,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815529687] [2019-11-20 05:30:45,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:30:45,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:30:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:30:45,967 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-11-20 05:30:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:46,070 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2019-11-20 05:30:46,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:30:46,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 05:30:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:46,080 INFO L225 Difference]: With dead ends: 34 [2019-11-20 05:30:46,080 INFO L226 Difference]: Without dead ends: 18 [2019-11-20 05:30:46,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:30:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-20 05:30:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-20 05:30:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 05:30:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-20 05:30:46,108 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 10 [2019-11-20 05:30:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:46,109 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-20 05:30:46,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:30:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2019-11-20 05:30:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:30:46,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:46,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:46,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2136724782, now seen corresponding path program 1 times [2019-11-20 05:30:46,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:46,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146105085] [2019-11-20 05:30:46,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:46,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146105085] [2019-11-20 05:30:46,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:30:46,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:30:46,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658628002] [2019-11-20 05:30:46,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:30:46,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:46,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:30:46,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:30:46,147 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 4 states. [2019-11-20 05:30:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:46,215 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-11-20 05:30:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:30:46,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 05:30:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:46,216 INFO L225 Difference]: With dead ends: 31 [2019-11-20 05:30:46,216 INFO L226 Difference]: Without dead ends: 18 [2019-11-20 05:30:46,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:30:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-20 05:30:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-20 05:30:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 05:30:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-20 05:30:46,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2019-11-20 05:30:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:46,224 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-20 05:30:46,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:30:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-11-20 05:30:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:30:46,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:46,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:46,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1478184144, now seen corresponding path program 1 times [2019-11-20 05:30:46,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:46,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84092661] [2019-11-20 05:30:46,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:30:46,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84092661] [2019-11-20 05:30:46,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:30:46,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:30:46,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559062942] [2019-11-20 05:30:46,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:30:46,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:30:46,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:30:46,266 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2019-11-20 05:30:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:46,303 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-11-20 05:30:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:30:46,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 05:30:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:46,304 INFO L225 Difference]: With dead ends: 42 [2019-11-20 05:30:46,304 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 05:30:46,305 INFO L630 BasicCegarLoop]: 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 [2019-11-20 05:30:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 05:30:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-11-20 05:30:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 05:30:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-20 05:30:46,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 13 [2019-11-20 05:30:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:46,309 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-20 05:30:46,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:30:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2019-11-20 05:30:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 05:30:46,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:46,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:46,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1047433017, now seen corresponding path program 1 times [2019-11-20 05:30:46,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:46,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140843396] [2019-11-20 05:30:46,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:46,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140843396] [2019-11-20 05:30:46,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177411501] [2019-11-20 05:30:46,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:46,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:30:46,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:46,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:46,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-20 05:30:46,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693635934] [2019-11-20 05:30:46,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:30:46,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:30:46,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:30:46,521 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 10 states. [2019-11-20 05:30:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:46,768 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2019-11-20 05:30:46,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:30:46,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-20 05:30:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:46,772 INFO L225 Difference]: With dead ends: 70 [2019-11-20 05:30:46,772 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 05:30:46,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:30:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 05:30:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 23. [2019-11-20 05:30:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 05:30:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 05:30:46,782 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-20 05:30:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:46,782 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 05:30:46,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:30:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-20 05:30:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:30:46,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:46,784 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:46,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:46,988 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1825215219, now seen corresponding path program 1 times [2019-11-20 05:30:46,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:46,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52205547] [2019-11-20 05:30:46,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:30:47,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52205547] [2019-11-20 05:30:47,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:30:47,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:30:47,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448058393] [2019-11-20 05:30:47,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:30:47,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:47,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:30:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:30:47,022 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-11-20 05:30:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:47,067 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-11-20 05:30:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:30:47,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 05:30:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:47,069 INFO L225 Difference]: With dead ends: 52 [2019-11-20 05:30:47,069 INFO L226 Difference]: Without dead ends: 31 [2019-11-20 05:30:47,070 INFO L630 BasicCegarLoop]: 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 [2019-11-20 05:30:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-20 05:30:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-11-20 05:30:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 05:30:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 05:30:47,075 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2019-11-20 05:30:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:47,075 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 05:30:47,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:30:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-20 05:30:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:30:47,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:47,076 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:47,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1882473521, now seen corresponding path program 1 times [2019-11-20 05:30:47,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:47,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326014449] [2019-11-20 05:30:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:30:47,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326014449] [2019-11-20 05:30:47,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:30:47,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:30:47,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985605499] [2019-11-20 05:30:47,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:30:47,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:47,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:30:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:30:47,144 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2019-11-20 05:30:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:47,178 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-11-20 05:30:47,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:30:47,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 05:30:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:47,179 INFO L225 Difference]: With dead ends: 65 [2019-11-20 05:30:47,180 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 05:30:47,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:30:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 05:30:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-20 05:30:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 05:30:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2019-11-20 05:30:47,188 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 16 [2019-11-20 05:30:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:47,188 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-11-20 05:30:47,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:30:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2019-11-20 05:30:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:30:47,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:47,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:47,189 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1882533103, now seen corresponding path program 1 times [2019-11-20 05:30:47,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:47,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54046009] [2019-11-20 05:30:47,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:47,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54046009] [2019-11-20 05:30:47,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633399487] [2019-11-20 05:30:47,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:47,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:30:47,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:47,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:47,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-20 05:30:47,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004061331] [2019-11-20 05:30:47,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:30:47,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:30:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:30:47,355 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand 10 states. [2019-11-20 05:30:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:47,741 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2019-11-20 05:30:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 05:30:47,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-20 05:30:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:47,743 INFO L225 Difference]: With dead ends: 161 [2019-11-20 05:30:47,743 INFO L226 Difference]: Without dead ends: 121 [2019-11-20 05:30:47,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:30:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-20 05:30:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2019-11-20 05:30:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 05:30:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2019-11-20 05:30:47,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 16 [2019-11-20 05:30:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:47,762 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2019-11-20 05:30:47,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:30:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2019-11-20 05:30:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 05:30:47,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:47,764 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:47,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:47,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1169498870, now seen corresponding path program 2 times [2019-11-20 05:30:47,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:47,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991745323] [2019-11-20 05:30:47,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:48,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991745323] [2019-11-20 05:30:48,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049834936] [2019-11-20 05:30:48,050 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:48,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:30:48,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:48,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:30:48,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:48,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:48,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 05:30:48,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943836540] [2019-11-20 05:30:48,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:30:48,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:48,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:30:48,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:30:48,169 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 13 states. [2019-11-20 05:30:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:48,391 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2019-11-20 05:30:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 05:30:48,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-11-20 05:30:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:48,393 INFO L225 Difference]: With dead ends: 221 [2019-11-20 05:30:48,393 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 05:30:48,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:30:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 05:30:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2019-11-20 05:30:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 05:30:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2019-11-20 05:30:48,423 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 19 [2019-11-20 05:30:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:48,423 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2019-11-20 05:30:48,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:30:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2019-11-20 05:30:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 05:30:48,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:48,426 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:48,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:48,638 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1256265881, now seen corresponding path program 1 times [2019-11-20 05:30:48,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:48,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586327910] [2019-11-20 05:30:48,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:48,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586327910] [2019-11-20 05:30:48,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892894036] [2019-11-20 05:30:48,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:48,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 05:30:48,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:48,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:48,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 05:30:48,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896527663] [2019-11-20 05:30:48,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 05:30:48,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 05:30:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:30:48,793 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand 11 states. [2019-11-20 05:30:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:48,863 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2019-11-20 05:30:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:30:48,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-20 05:30:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:48,865 INFO L225 Difference]: With dead ends: 197 [2019-11-20 05:30:48,865 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 05:30:48,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:30:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 05:30:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2019-11-20 05:30:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-20 05:30:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2019-11-20 05:30:48,876 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 20 [2019-11-20 05:30:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:48,877 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2019-11-20 05:30:48,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 05:30:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2019-11-20 05:30:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:30:48,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:48,878 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:49,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:49,079 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 203649807, now seen corresponding path program 3 times [2019-11-20 05:30:49,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:49,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627287533] [2019-11-20 05:30:49,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:49,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627287533] [2019-11-20 05:30:49,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882308763] [2019-11-20 05:30:49,191 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:49,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 05:30:49,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:49,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:30:49,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 05:30:49,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:30:49,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-20 05:30:49,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516682038] [2019-11-20 05:30:49,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:30:49,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:30:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:30:49,269 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand 4 states. [2019-11-20 05:30:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:49,313 INFO L93 Difference]: Finished difference Result 218 states and 288 transitions. [2019-11-20 05:30:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:30:49,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-20 05:30:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:49,315 INFO L225 Difference]: With dead ends: 218 [2019-11-20 05:30:49,315 INFO L226 Difference]: Without dead ends: 126 [2019-11-20 05:30:49,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:30:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-20 05:30:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2019-11-20 05:30:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 05:30:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2019-11-20 05:30:49,326 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 22 [2019-11-20 05:30:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:49,326 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2019-11-20 05:30:49,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:30:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2019-11-20 05:30:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:30:49,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:49,327 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:49,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:49,531 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:49,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash -617261500, now seen corresponding path program 2 times [2019-11-20 05:30:49,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:49,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885378600] [2019-11-20 05:30:49,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:49,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885378600] [2019-11-20 05:30:49,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792897400] [2019-11-20 05:30:49,638 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:49,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:30:49,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:49,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:30:49,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:49,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:49,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 05:30:49,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985096992] [2019-11-20 05:30:49,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:30:49,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:30:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:30:49,739 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 13 states. [2019-11-20 05:30:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:49,858 INFO L93 Difference]: Finished difference Result 249 states and 317 transitions. [2019-11-20 05:30:49,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:30:49,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-20 05:30:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:49,859 INFO L225 Difference]: With dead ends: 249 [2019-11-20 05:30:49,859 INFO L226 Difference]: Without dead ends: 147 [2019-11-20 05:30:49,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:30:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-20 05:30:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2019-11-20 05:30:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 05:30:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2019-11-20 05:30:49,874 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 23 [2019-11-20 05:30:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:49,874 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2019-11-20 05:30:49,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:30:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2019-11-20 05:30:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:30:49,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:49,876 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:50,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:50,081 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 667196999, now seen corresponding path program 3 times [2019-11-20 05:30:50,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:50,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155123223] [2019-11-20 05:30:50,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:50,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155123223] [2019-11-20 05:30:50,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87020671] [2019-11-20 05:30:50,150 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:50,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 05:30:50,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:50,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 05:30:50,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:50,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:30:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 05:30:50,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:30:50,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2019-11-20 05:30:50,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970534252] [2019-11-20 05:30:50,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:30:50,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:30:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:30:50,336 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand 8 states. [2019-11-20 05:30:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:50,480 INFO L93 Difference]: Finished difference Result 280 states and 347 transitions. [2019-11-20 05:30:50,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 05:30:50,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-20 05:30:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:50,484 INFO L225 Difference]: With dead ends: 280 [2019-11-20 05:30:50,484 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 05:30:50,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:30:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 05:30:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2019-11-20 05:30:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-20 05:30:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2019-11-20 05:30:50,503 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 26 [2019-11-20 05:30:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:50,504 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2019-11-20 05:30:50,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:30:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2019-11-20 05:30:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:30:50,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:50,517 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:50,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:50,730 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash 475238213, now seen corresponding path program 1 times [2019-11-20 05:30:50,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:50,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472674733] [2019-11-20 05:30:50,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:30:50,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472674733] [2019-11-20 05:30:50,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:30:50,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:30:50,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971416965] [2019-11-20 05:30:50,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:30:50,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:30:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:30:50,755 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand 4 states. [2019-11-20 05:30:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:50,776 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2019-11-20 05:30:50,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:30:50,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-20 05:30:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:50,777 INFO L225 Difference]: With dead ends: 260 [2019-11-20 05:30:50,777 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 05:30:50,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:30:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 05:30:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-11-20 05:30:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-20 05:30:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2019-11-20 05:30:50,789 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 26 [2019-11-20 05:30:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:50,789 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2019-11-20 05:30:50,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:30:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2019-11-20 05:30:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:30:50,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:50,790 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:50,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 477144837, now seen corresponding path program 1 times [2019-11-20 05:30:50,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:50,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284773053] [2019-11-20 05:30:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:30:50,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284773053] [2019-11-20 05:30:50,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360621923] [2019-11-20 05:30:50,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:50,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:30:50,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:51,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:51,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-20 05:30:51,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318518787] [2019-11-20 05:30:51,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 05:30:51,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 05:30:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:30:51,025 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand 15 states. [2019-11-20 05:30:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:51,497 INFO L93 Difference]: Finished difference Result 483 states and 604 transitions. [2019-11-20 05:30:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 05:30:51,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-20 05:30:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:51,500 INFO L225 Difference]: With dead ends: 483 [2019-11-20 05:30:51,500 INFO L226 Difference]: Without dead ends: 337 [2019-11-20 05:30:51,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2019-11-20 05:30:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-20 05:30:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 205. [2019-11-20 05:30:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-20 05:30:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2019-11-20 05:30:51,516 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 26 [2019-11-20 05:30:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:51,516 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2019-11-20 05:30:51,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 05:30:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2019-11-20 05:30:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:30:51,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:51,518 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:51,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:51,729 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2135503200, now seen corresponding path program 2 times [2019-11-20 05:30:51,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:51,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516918394] [2019-11-20 05:30:51,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:30:51,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516918394] [2019-11-20 05:30:51,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804827447] [2019-11-20 05:30:51,832 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:51,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:30:51,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:51,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 05:30:51,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:30:51,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:51,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-20 05:30:51,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95097760] [2019-11-20 05:30:51,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 05:30:51,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 05:30:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:30:51,971 INFO L87 Difference]: Start difference. First operand 205 states and 251 transitions. Second operand 17 states. [2019-11-20 05:30:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:52,212 INFO L93 Difference]: Finished difference Result 424 states and 525 transitions. [2019-11-20 05:30:52,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 05:30:52,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-20 05:30:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:52,214 INFO L225 Difference]: With dead ends: 424 [2019-11-20 05:30:52,214 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 05:30:52,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-11-20 05:30:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 05:30:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2019-11-20 05:30:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-20 05:30:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2019-11-20 05:30:52,229 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 29 [2019-11-20 05:30:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:52,229 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2019-11-20 05:30:52,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 05:30:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2019-11-20 05:30:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:30:52,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:52,230 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:52,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:52,434 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1548697186, now seen corresponding path program 3 times [2019-11-20 05:30:52,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:52,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052272564] [2019-11-20 05:30:52,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052272564] [2019-11-20 05:30:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137993554] [2019-11-20 05:30:52,516 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:52,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 05:30:52,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:52,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 05:30:52,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:52,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:30:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 05:30:52,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:30:52,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2019-11-20 05:30:52,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082938831] [2019-11-20 05:30:52,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:30:52,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:30:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:30:52,686 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand 8 states. [2019-11-20 05:30:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:52,876 INFO L93 Difference]: Finished difference Result 258 states and 315 transitions. [2019-11-20 05:30:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 05:30:52,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-20 05:30:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:52,878 INFO L225 Difference]: With dead ends: 258 [2019-11-20 05:30:52,878 INFO L226 Difference]: Without dead ends: 256 [2019-11-20 05:30:52,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:30:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-20 05:30:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2019-11-20 05:30:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-20 05:30:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2019-11-20 05:30:52,891 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 29 [2019-11-20 05:30:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:52,892 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2019-11-20 05:30:52,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:30:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2019-11-20 05:30:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:30:52,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:52,892 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:30:53,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:53,097 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1366196382, now seen corresponding path program 2 times [2019-11-20 05:30:53,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:53,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688578360] [2019-11-20 05:30:53,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:53,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688578360] [2019-11-20 05:30:53,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650798573] [2019-11-20 05:30:53,246 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:53,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 05:30:53,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:53,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:30:53,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 05:30:53,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:30:53,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-11-20 05:30:53,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701688511] [2019-11-20 05:30:53,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:30:53,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:30:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:30:53,344 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand 5 states. [2019-11-20 05:30:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:53,387 INFO L93 Difference]: Finished difference Result 345 states and 426 transitions. [2019-11-20 05:30:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:30:53,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-20 05:30:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:53,389 INFO L225 Difference]: With dead ends: 345 [2019-11-20 05:30:53,389 INFO L226 Difference]: Without dead ends: 273 [2019-11-20 05:30:53,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:30:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-20 05:30:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 231. [2019-11-20 05:30:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-20 05:30:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2019-11-20 05:30:53,407 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 29 [2019-11-20 05:30:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:53,408 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2019-11-20 05:30:53,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:30:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2019-11-20 05:30:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 05:30:53,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:53,409 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:30:53,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:53,613 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:53,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash 531419276, now seen corresponding path program 1 times [2019-11-20 05:30:53,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:53,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397213118] [2019-11-20 05:30:53,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 34 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:53,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397213118] [2019-11-20 05:30:53,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847917076] [2019-11-20 05:30:53,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:53,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 05:30:53,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 05:30:54,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:54,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2019-11-20 05:30:54,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923061985] [2019-11-20 05:30:54,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 05:30:54,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 05:30:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-11-20 05:30:54,106 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand 26 states. [2019-11-20 05:30:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:54,509 INFO L93 Difference]: Finished difference Result 551 states and 679 transitions. [2019-11-20 05:30:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 05:30:54,509 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-11-20 05:30:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:54,511 INFO L225 Difference]: With dead ends: 551 [2019-11-20 05:30:54,511 INFO L226 Difference]: Without dead ends: 359 [2019-11-20 05:30:54,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 05:30:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-20 05:30:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 266. [2019-11-20 05:30:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-20 05:30:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 327 transitions. [2019-11-20 05:30:54,531 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 327 transitions. Word has length 55 [2019-11-20 05:30:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:54,532 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 327 transitions. [2019-11-20 05:30:54,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 05:30:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2019-11-20 05:30:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 05:30:54,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:54,533 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:30:54,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:54,737 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1993539556, now seen corresponding path program 2 times [2019-11-20 05:30:54,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:54,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126823929] [2019-11-20 05:30:54,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 39 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:55,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126823929] [2019-11-20 05:30:55,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706561840] [2019-11-20 05:30:55,016 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:55,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:30:55,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:55,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:30:55,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 163 proven. 70 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-20 05:30:55,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:55,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2019-11-20 05:30:55,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950953743] [2019-11-20 05:30:55,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 05:30:55,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 05:30:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2019-11-20 05:30:55,220 INFO L87 Difference]: Start difference. First operand 266 states and 327 transitions. Second operand 29 states. [2019-11-20 05:30:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:30:55,755 INFO L93 Difference]: Finished difference Result 644 states and 783 transitions. [2019-11-20 05:30:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 05:30:55,758 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-11-20 05:30:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:30:55,761 INFO L225 Difference]: With dead ends: 644 [2019-11-20 05:30:55,761 INFO L226 Difference]: Without dead ends: 425 [2019-11-20 05:30:55,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1543, Unknown=0, NotChecked=0, Total=1980 [2019-11-20 05:30:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-20 05:30:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 305. [2019-11-20 05:30:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-20 05:30:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 372 transitions. [2019-11-20 05:30:55,783 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 372 transitions. Word has length 61 [2019-11-20 05:30:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:30:55,784 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 372 transitions. [2019-11-20 05:30:55,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 05:30:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 372 transitions. [2019-11-20 05:30:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 05:30:55,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:30:55,785 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:30:55,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:55,993 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:30:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:30:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1561582796, now seen corresponding path program 3 times [2019-11-20 05:30:55,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:30:55,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278126438] [2019-11-20 05:30:55,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:30:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:30:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 44 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:30:56,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278126438] [2019-11-20 05:30:56,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606246120] [2019-11-20 05:30:56,283 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:30:56,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 05:30:56,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:30:56,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:30:56,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:30:56,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:30:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 22 proven. 216 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-20 05:30:56,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:30:56,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 30 [2019-11-20 05:30:56,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376539427] [2019-11-20 05:30:56,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-20 05:30:56,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:30:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 05:30:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-11-20 05:30:56,454 INFO L87 Difference]: Start difference. First operand 305 states and 372 transitions. Second operand 30 states. [2019-11-20 05:31:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:01,010 INFO L93 Difference]: Finished difference Result 1614 states and 1904 transitions. [2019-11-20 05:31:01,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-11-20 05:31:01,010 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-11-20 05:31:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:01,017 INFO L225 Difference]: With dead ends: 1614 [2019-11-20 05:31:01,017 INFO L226 Difference]: Without dead ends: 1512 [2019-11-20 05:31:01,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11671 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4550, Invalid=24180, Unknown=0, NotChecked=0, Total=28730 [2019-11-20 05:31:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-11-20 05:31:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 644. [2019-11-20 05:31:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-20 05:31:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 755 transitions. [2019-11-20 05:31:01,082 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 755 transitions. Word has length 67 [2019-11-20 05:31:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:01,082 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 755 transitions. [2019-11-20 05:31:01,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-20 05:31:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 755 transitions. [2019-11-20 05:31:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 05:31:01,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:01,083 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:01,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:01,284 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -577843254, now seen corresponding path program 1 times [2019-11-20 05:31:01,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:01,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380322074] [2019-11-20 05:31:01,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 26 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:31:01,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380322074] [2019-11-20 05:31:01,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934404942] [2019-11-20 05:31:01,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:01,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 05:31:01,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 92 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 05:31:01,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:01,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 34 [2019-11-20 05:31:01,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980936279] [2019-11-20 05:31:01,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-20 05:31:01,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-20 05:31:01,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 05:31:01,842 INFO L87 Difference]: Start difference. First operand 644 states and 755 transitions. Second operand 35 states. [2019-11-20 05:31:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:04,754 INFO L93 Difference]: Finished difference Result 2064 states and 2515 transitions. [2019-11-20 05:31:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-11-20 05:31:04,757 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-11-20 05:31:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:04,764 INFO L225 Difference]: With dead ends: 2064 [2019-11-20 05:31:04,765 INFO L226 Difference]: Without dead ends: 1493 [2019-11-20 05:31:04,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2552, Invalid=11728, Unknown=0, NotChecked=0, Total=14280 [2019-11-20 05:31:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-11-20 05:31:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 501. [2019-11-20 05:31:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-11-20 05:31:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 608 transitions. [2019-11-20 05:31:04,820 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 608 transitions. Word has length 67 [2019-11-20 05:31:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:04,821 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 608 transitions. [2019-11-20 05:31:04,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-20 05:31:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 608 transitions. [2019-11-20 05:31:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 05:31:04,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:04,822 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 12, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:05,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:05,026 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2091458462, now seen corresponding path program 2 times [2019-11-20 05:31:05,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:05,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435831753] [2019-11-20 05:31:05,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 34 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:31:05,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435831753] [2019-11-20 05:31:05,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204483857] [2019-11-20 05:31:05,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:05,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:31:05,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:05,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 05:31:05,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 263 proven. 117 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 05:31:05,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:05,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12] total 37 [2019-11-20 05:31:05,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874824278] [2019-11-20 05:31:05,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-20 05:31:05,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-20 05:31:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 05:31:05,732 INFO L87 Difference]: Start difference. First operand 501 states and 608 transitions. Second operand 38 states. [2019-11-20 05:31:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:08,793 INFO L93 Difference]: Finished difference Result 1888 states and 2315 transitions. [2019-11-20 05:31:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-20 05:31:08,795 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-11-20 05:31:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:08,800 INFO L225 Difference]: With dead ends: 1888 [2019-11-20 05:31:08,801 INFO L226 Difference]: Without dead ends: 1452 [2019-11-20 05:31:08,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5281 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3026, Invalid=14004, Unknown=0, NotChecked=0, Total=17030 [2019-11-20 05:31:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-20 05:31:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 558. [2019-11-20 05:31:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-20 05:31:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 674 transitions. [2019-11-20 05:31:08,856 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 674 transitions. Word has length 73 [2019-11-20 05:31:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:08,857 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 674 transitions. [2019-11-20 05:31:08,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-20 05:31:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 674 transitions. [2019-11-20 05:31:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 05:31:08,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:08,858 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 14, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:09,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:09,061 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:09,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2051483018, now seen corresponding path program 3 times [2019-11-20 05:31:09,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:09,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664423441] [2019-11-20 05:31:09,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 45 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:31:09,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664423441] [2019-11-20 05:31:09,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117525888] [2019-11-20 05:31:09,571 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:09,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 05:31:09,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:09,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:31:09,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 355 proven. 1 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-11-20 05:31:09,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:09,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 8] total 36 [2019-11-20 05:31:09,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567734730] [2019-11-20 05:31:09,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 05:31:09,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 05:31:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 05:31:09,838 INFO L87 Difference]: Start difference. First operand 558 states and 674 transitions. Second operand 36 states. [2019-11-20 05:31:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:13,859 INFO L93 Difference]: Finished difference Result 1347 states and 1622 transitions. [2019-11-20 05:31:13,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-11-20 05:31:13,859 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-11-20 05:31:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:13,863 INFO L225 Difference]: With dead ends: 1347 [2019-11-20 05:31:13,863 INFO L226 Difference]: Without dead ends: 952 [2019-11-20 05:31:13,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6788 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3236, Invalid=17356, Unknown=0, NotChecked=0, Total=20592 [2019-11-20 05:31:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-11-20 05:31:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 691. [2019-11-20 05:31:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-20 05:31:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 788 transitions. [2019-11-20 05:31:13,932 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 788 transitions. Word has length 79 [2019-11-20 05:31:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:13,932 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 788 transitions. [2019-11-20 05:31:13,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 05:31:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 788 transitions. [2019-11-20 05:31:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 05:31:13,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:13,935 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:14,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:14,147 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -741345910, now seen corresponding path program 4 times [2019-11-20 05:31:14,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:14,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028956856] [2019-11-20 05:31:14,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 31 proven. 547 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 05:31:14,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028956856] [2019-11-20 05:31:14,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550572608] [2019-11-20 05:31:14,424 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:14,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 05:31:14,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:14,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 05:31:14,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 297 proven. 295 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:31:14,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:14,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2019-11-20 05:31:14,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017704735] [2019-11-20 05:31:14,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-20 05:31:14,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-20 05:31:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 05:31:14,845 INFO L87 Difference]: Start difference. First operand 691 states and 788 transitions. Second operand 41 states. [2019-11-20 05:31:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:18,311 INFO L93 Difference]: Finished difference Result 1706 states and 1934 transitions. [2019-11-20 05:31:18,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-11-20 05:31:18,312 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-11-20 05:31:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:18,318 INFO L225 Difference]: With dead ends: 1706 [2019-11-20 05:31:18,318 INFO L226 Difference]: Without dead ends: 1228 [2019-11-20 05:31:18,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4517 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2905, Invalid=13097, Unknown=0, NotChecked=0, Total=16002 [2019-11-20 05:31:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-11-20 05:31:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 464. [2019-11-20 05:31:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-20 05:31:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 532 transitions. [2019-11-20 05:31:18,362 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 532 transitions. Word has length 79 [2019-11-20 05:31:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:18,363 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 532 transitions. [2019-11-20 05:31:18,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-20 05:31:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 532 transitions. [2019-11-20 05:31:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 05:31:18,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:18,364 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 15, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:31:18,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:18,568 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -216004410, now seen corresponding path program 1 times [2019-11-20 05:31:18,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:18,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903437484] [2019-11-20 05:31:18,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 103 proven. 513 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:31:18,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903437484] [2019-11-20 05:31:18,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352952469] [2019-11-20 05:31:18,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:19,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 05:31:19,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-20 05:31:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:19,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2019-11-20 05:31:19,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882255715] [2019-11-20 05:31:19,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-20 05:31:19,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-20 05:31:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 05:31:19,313 INFO L87 Difference]: Start difference. First operand 464 states and 532 transitions. Second operand 41 states. [2019-11-20 05:31:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:21,469 INFO L93 Difference]: Finished difference Result 1055 states and 1220 transitions. [2019-11-20 05:31:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-20 05:31:21,469 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-11-20 05:31:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:21,472 INFO L225 Difference]: With dead ends: 1055 [2019-11-20 05:31:21,473 INFO L226 Difference]: Without dead ends: 609 [2019-11-20 05:31:21,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4014 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2656, Invalid=10226, Unknown=0, NotChecked=0, Total=12882 [2019-11-20 05:31:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-11-20 05:31:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 544. [2019-11-20 05:31:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-20 05:31:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 620 transitions. [2019-11-20 05:31:21,524 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 620 transitions. Word has length 79 [2019-11-20 05:31:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:21,524 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 620 transitions. [2019-11-20 05:31:21,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-20 05:31:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 620 transitions. [2019-11-20 05:31:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:31:21,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:21,526 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 12, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:21,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:21,729 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 600454234, now seen corresponding path program 5 times [2019-11-20 05:31:21,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:21,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693326221] [2019-11-20 05:31:21,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 31 proven. 657 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 05:31:22,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693326221] [2019-11-20 05:31:22,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405846693] [2019-11-20 05:31:22,022 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:22,062 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-11-20 05:31:22,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:22,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 05:31:22,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-20 05:31:22,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:22,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-11-20 05:31:22,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718926769] [2019-11-20 05:31:22,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 05:31:22,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:22,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 05:31:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 05:31:22,329 INFO L87 Difference]: Start difference. First operand 544 states and 620 transitions. Second operand 36 states. [2019-11-20 05:31:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:22,851 INFO L93 Difference]: Finished difference Result 1116 states and 1284 transitions. [2019-11-20 05:31:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-20 05:31:22,852 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2019-11-20 05:31:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:22,854 INFO L225 Difference]: With dead ends: 1116 [2019-11-20 05:31:22,854 INFO L226 Difference]: Without dead ends: 657 [2019-11-20 05:31:22,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=763, Invalid=2543, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 05:31:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-20 05:31:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 592. [2019-11-20 05:31:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-20 05:31:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 671 transitions. [2019-11-20 05:31:22,894 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 671 transitions. Word has length 85 [2019-11-20 05:31:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:22,895 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 671 transitions. [2019-11-20 05:31:22,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 05:31:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 671 transitions. [2019-11-20 05:31:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:31:22,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:22,896 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:23,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:23,100 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1846584762, now seen corresponding path program 6 times [2019-11-20 05:31:23,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:23,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040288450] [2019-11-20 05:31:23,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 45 proven. 782 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 05:31:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040288450] [2019-11-20 05:31:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139539912] [2019-11-20 05:31:23,461 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:23,504 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-20 05:31:23,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:23,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 05:31:23,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:31:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 34 proven. 464 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-11-20 05:31:23,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:23,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9] total 33 [2019-11-20 05:31:23,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661341899] [2019-11-20 05:31:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-20 05:31:23,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-20 05:31:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 05:31:23,674 INFO L87 Difference]: Start difference. First operand 592 states and 671 transitions. Second operand 33 states. [2019-11-20 05:31:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:28,093 INFO L93 Difference]: Finished difference Result 1813 states and 2060 transitions. [2019-11-20 05:31:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-11-20 05:31:28,094 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2019-11-20 05:31:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:28,099 INFO L225 Difference]: With dead ends: 1813 [2019-11-20 05:31:28,099 INFO L226 Difference]: Without dead ends: 1509 [2019-11-20 05:31:28,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11608 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4196, Invalid=26254, Unknown=0, NotChecked=0, Total=30450 [2019-11-20 05:31:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2019-11-20 05:31:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 703. [2019-11-20 05:31:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-11-20 05:31:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 799 transitions. [2019-11-20 05:31:28,163 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 799 transitions. Word has length 91 [2019-11-20 05:31:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:28,163 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 799 transitions. [2019-11-20 05:31:28,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-20 05:31:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 799 transitions. [2019-11-20 05:31:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:31:28,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:28,165 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 18, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:31:28,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:28,369 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1046927688, now seen corresponding path program 2 times [2019-11-20 05:31:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:28,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613317922] [2019-11-20 05:31:28,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 166 proven. 716 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:31:28,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613317922] [2019-11-20 05:31:28,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641466905] [2019-11-20 05:31:28,842 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:28,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:31:28,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:28,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 05:31:28,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 6 proven. 469 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-11-20 05:31:29,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:29,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-11-20 05:31:29,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847341672] [2019-11-20 05:31:29,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-20 05:31:29,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-20 05:31:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 05:31:29,137 INFO L87 Difference]: Start difference. First operand 703 states and 799 transitions. Second operand 44 states. [2019-11-20 05:31:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:30,484 INFO L93 Difference]: Finished difference Result 1274 states and 1456 transitions. [2019-11-20 05:31:30,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-20 05:31:30,489 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 91 [2019-11-20 05:31:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:30,493 INFO L225 Difference]: With dead ends: 1274 [2019-11-20 05:31:30,493 INFO L226 Difference]: Without dead ends: 927 [2019-11-20 05:31:30,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1417, Invalid=7139, Unknown=0, NotChecked=0, Total=8556 [2019-11-20 05:31:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-20 05:31:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 809. [2019-11-20 05:31:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-11-20 05:31:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 927 transitions. [2019-11-20 05:31:30,564 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 927 transitions. Word has length 91 [2019-11-20 05:31:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:30,564 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 927 transitions. [2019-11-20 05:31:30,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-20 05:31:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 927 transitions. [2019-11-20 05:31:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:31:30,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:30,566 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 19, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:31:30,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:30,770 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash 314960262, now seen corresponding path program 3 times [2019-11-20 05:31:30,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:30,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135330438] [2019-11-20 05:31:30,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 152 proven. 730 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:31:31,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135330438] [2019-11-20 05:31:31,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955859028] [2019-11-20 05:31:31,299 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:31,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 05:31:31,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:31,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 05:31:31,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:31:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:31:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:31:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:31:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-20 05:31:31,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:31,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9] total 41 [2019-11-20 05:31:31,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905027199] [2019-11-20 05:31:31,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-20 05:31:31,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-20 05:31:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 05:31:31,607 INFO L87 Difference]: Start difference. First operand 809 states and 927 transitions. Second operand 41 states. [2019-11-20 05:31:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:37,452 INFO L93 Difference]: Finished difference Result 1477 states and 1638 transitions. [2019-11-20 05:31:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-11-20 05:31:37,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2019-11-20 05:31:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:37,457 INFO L225 Difference]: With dead ends: 1477 [2019-11-20 05:31:37,457 INFO L226 Difference]: Without dead ends: 1238 [2019-11-20 05:31:37,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12933 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5869, Invalid=30041, Unknown=0, NotChecked=0, Total=35910 [2019-11-20 05:31:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-11-20 05:31:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 887. [2019-11-20 05:31:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-20 05:31:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1011 transitions. [2019-11-20 05:31:37,526 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1011 transitions. Word has length 91 [2019-11-20 05:31:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:37,526 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1011 transitions. [2019-11-20 05:31:37,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-20 05:31:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1011 transitions. [2019-11-20 05:31:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:31:37,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:37,528 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 21, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:37,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:37,729 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1277696966, now seen corresponding path program 1 times [2019-11-20 05:31:37,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:37,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730205037] [2019-11-20 05:31:37,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:31:38,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730205037] [2019-11-20 05:31:38,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520462218] [2019-11-20 05:31:38,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:38,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 05:31:38,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-20 05:31:39,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:39,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 15] total 50 [2019-11-20 05:31:39,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199368562] [2019-11-20 05:31:39,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-20 05:31:39,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:39,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-20 05:31:39,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2160, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 05:31:39,030 INFO L87 Difference]: Start difference. First operand 887 states and 1011 transitions. Second operand 51 states. [2019-11-20 05:31:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:45,202 INFO L93 Difference]: Finished difference Result 2514 states and 2913 transitions. [2019-11-20 05:31:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-11-20 05:31:45,203 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 91 [2019-11-20 05:31:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:45,208 INFO L225 Difference]: With dead ends: 2514 [2019-11-20 05:31:45,208 INFO L226 Difference]: Without dead ends: 1729 [2019-11-20 05:31:45,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15194 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9076, Invalid=33980, Unknown=0, NotChecked=0, Total=43056 [2019-11-20 05:31:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-11-20 05:31:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1086. [2019-11-20 05:31:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-11-20 05:31:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1247 transitions. [2019-11-20 05:31:45,290 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1247 transitions. Word has length 91 [2019-11-20 05:31:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:45,290 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1247 transitions. [2019-11-20 05:31:45,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-20 05:31:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1247 transitions. [2019-11-20 05:31:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 05:31:45,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:45,292 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 22, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:45,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:45,495 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 763529758, now seen corresponding path program 7 times [2019-11-20 05:31:45,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:45,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467204481] [2019-11-20 05:31:45,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 171 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:31:46,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467204481] [2019-11-20 05:31:46,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390469396] [2019-11-20 05:31:46,215 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:46,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 05:31:46,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-20 05:31:46,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:46,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16] total 51 [2019-11-20 05:31:46,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369174246] [2019-11-20 05:31:46,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-20 05:31:46,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-20 05:31:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2019-11-20 05:31:46,624 INFO L87 Difference]: Start difference. First operand 1086 states and 1247 transitions. Second operand 52 states. [2019-11-20 05:31:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:31:55,046 INFO L93 Difference]: Finished difference Result 2867 states and 3266 transitions. [2019-11-20 05:31:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2019-11-20 05:31:55,046 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2019-11-20 05:31:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:31:55,052 INFO L225 Difference]: With dead ends: 2867 [2019-11-20 05:31:55,052 INFO L226 Difference]: Without dead ends: 1843 [2019-11-20 05:31:55,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24179 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11872, Invalid=53408, Unknown=0, NotChecked=0, Total=65280 [2019-11-20 05:31:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-11-20 05:31:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1097. [2019-11-20 05:31:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-20 05:31:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1253 transitions. [2019-11-20 05:31:55,126 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1253 transitions. Word has length 97 [2019-11-20 05:31:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:31:55,126 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1253 transitions. [2019-11-20 05:31:55,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-20 05:31:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1253 transitions. [2019-11-20 05:31:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 05:31:55,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:31:55,127 INFO L410 BasicCegarLoop]: trace histogram [28, 28, 24, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:31:55,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:55,329 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:31:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:31:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash -850803962, now seen corresponding path program 8 times [2019-11-20 05:31:55,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:31:55,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532102991] [2019-11-20 05:31:55,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:31:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:31:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 203 proven. 995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:31:55,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532102991] [2019-11-20 05:31:55,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256543349] [2019-11-20 05:31:55,974 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:31:56,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:31:56,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:31:56,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 05:31:56,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:31:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 618 proven. 287 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-11-20 05:31:56,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:31:56,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 17] total 54 [2019-11-20 05:31:56,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815512322] [2019-11-20 05:31:56,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-20 05:31:56,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:31:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-20 05:31:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=2543, Unknown=0, NotChecked=0, Total=2970 [2019-11-20 05:31:56,432 INFO L87 Difference]: Start difference. First operand 1097 states and 1253 transitions. Second operand 55 states. [2019-11-20 05:32:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:06,717 INFO L93 Difference]: Finished difference Result 3278 states and 3733 transitions. [2019-11-20 05:32:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-11-20 05:32:06,717 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2019-11-20 05:32:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:06,725 INFO L225 Difference]: With dead ends: 3278 [2019-11-20 05:32:06,725 INFO L226 Difference]: Without dead ends: 2127 [2019-11-20 05:32:06,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29935 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14766, Invalid=65606, Unknown=0, NotChecked=0, Total=80372 [2019-11-20 05:32:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-11-20 05:32:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1172. [2019-11-20 05:32:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-20 05:32:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2019-11-20 05:32:06,810 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 103 [2019-11-20 05:32:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:06,810 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2019-11-20 05:32:06,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-20 05:32:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2019-11-20 05:32:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 05:32:06,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:06,812 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 26, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:32:07,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:07,015 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:07,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1300881630, now seen corresponding path program 9 times [2019-11-20 05:32:07,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:07,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658704353] [2019-11-20 05:32:07,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 238 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:32:07,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658704353] [2019-11-20 05:32:07,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643306413] [2019-11-20 05:32:07,716 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:07,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 05:32:07,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:32:07,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 05:32:07,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-11-20 05:32:07,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:32:07,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [41] total 46 [2019-11-20 05:32:07,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050815594] [2019-11-20 05:32:07,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:32:07,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:32:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1820, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 05:32:07,875 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 6 states. [2019-11-20 05:32:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:08,016 INFO L93 Difference]: Finished difference Result 1894 states and 2155 transitions. [2019-11-20 05:32:08,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:32:08,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-20 05:32:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:08,020 INFO L225 Difference]: With dead ends: 1894 [2019-11-20 05:32:08,020 INFO L226 Difference]: Without dead ends: 1163 [2019-11-20 05:32:08,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2019-11-20 05:32:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-11-20 05:32:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1090. [2019-11-20 05:32:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-11-20 05:32:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1237 transitions. [2019-11-20 05:32:08,096 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1237 transitions. Word has length 109 [2019-11-20 05:32:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:08,096 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1237 transitions. [2019-11-20 05:32:08,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:32:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1237 transitions. [2019-11-20 05:32:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 05:32:08,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:08,098 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:32:08,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:08,300 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 883309212, now seen corresponding path program 2 times [2019-11-20 05:32:08,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:08,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191195230] [2019-11-20 05:32:08,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1371 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:32:09,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191195230] [2019-11-20 05:32:09,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726761602] [2019-11-20 05:32:09,035 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:09,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:32:09,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:32:09,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 05:32:09,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 4 proven. 957 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-20 05:32:09,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:32:09,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 17] total 53 [2019-11-20 05:32:09,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976296528] [2019-11-20 05:32:09,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-20 05:32:09,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-20 05:32:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2019-11-20 05:32:09,485 INFO L87 Difference]: Start difference. First operand 1090 states and 1237 transitions. Second operand 54 states. [2019-11-20 05:32:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:10,967 INFO L93 Difference]: Finished difference Result 1399 states and 1589 transitions. [2019-11-20 05:32:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-20 05:32:10,967 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 109 [2019-11-20 05:32:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:10,973 INFO L225 Difference]: With dead ends: 1399 [2019-11-20 05:32:10,973 INFO L226 Difference]: Without dead ends: 1334 [2019-11-20 05:32:10,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-11-20 05:32:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-20 05:32:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1084. [2019-11-20 05:32:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-11-20 05:32:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1231 transitions. [2019-11-20 05:32:11,064 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1231 transitions. Word has length 109 [2019-11-20 05:32:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:11,065 INFO L462 AbstractCegarLoop]: Abstraction has 1084 states and 1231 transitions. [2019-11-20 05:32:11,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-20 05:32:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1231 transitions. [2019-11-20 05:32:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 05:32:11,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:11,066 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 29, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:32:11,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:11,266 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 151341786, now seen corresponding path program 3 times [2019-11-20 05:32:11,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:11,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308493032] [2019-11-20 05:32:11,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1373 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:32:12,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308493032] [2019-11-20 05:32:12,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703081811] [2019-11-20 05:32:12,212 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:12,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 05:32:12,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:32:12,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:32:12,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:12,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:32:12,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:32:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:32:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 711 proven. 2 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-11-20 05:32:12,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:32:12,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 44 [2019-11-20 05:32:12,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078262926] [2019-11-20 05:32:12,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-20 05:32:12,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-20 05:32:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 05:32:12,322 INFO L87 Difference]: Start difference. First operand 1084 states and 1231 transitions. Second operand 44 states. [2019-11-20 05:32:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:22,611 INFO L93 Difference]: Finished difference Result 3004 states and 3457 transitions. [2019-11-20 05:32:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-11-20 05:32:22,612 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2019-11-20 05:32:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:22,623 INFO L225 Difference]: With dead ends: 3004 [2019-11-20 05:32:22,624 INFO L226 Difference]: Without dead ends: 2924 [2019-11-20 05:32:22,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31325 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15637, Invalid=64735, Unknown=0, NotChecked=0, Total=80372 [2019-11-20 05:32:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-11-20 05:32:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1167. [2019-11-20 05:32:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-11-20 05:32:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1356 transitions. [2019-11-20 05:32:22,717 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1356 transitions. Word has length 109 [2019-11-20 05:32:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:22,717 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 1356 transitions. [2019-11-20 05:32:22,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-20 05:32:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1356 transitions. [2019-11-20 05:32:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 05:32:22,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:22,718 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:32:22,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:22,921 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash -498019554, now seen corresponding path program 1 times [2019-11-20 05:32:22,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:22,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438069719] [2019-11-20 05:32:22,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1373 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:32:23,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438069719] [2019-11-20 05:32:23,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734456956] [2019-11-20 05:32:23,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:23,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 05:32:23,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-20 05:32:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:32:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 18] total 57 [2019-11-20 05:32:24,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072407649] [2019-11-20 05:32:24,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-20 05:32:24,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-20 05:32:24,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 05:32:24,206 INFO L87 Difference]: Start difference. First operand 1167 states and 1356 transitions. Second operand 58 states. [2019-11-20 05:32:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:26,581 INFO L93 Difference]: Finished difference Result 2211 states and 2563 transitions. [2019-11-20 05:32:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-20 05:32:26,582 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2019-11-20 05:32:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:26,587 INFO L225 Difference]: With dead ends: 2211 [2019-11-20 05:32:26,587 INFO L226 Difference]: Without dead ends: 1314 [2019-11-20 05:32:26,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2172, Invalid=9818, Unknown=0, NotChecked=0, Total=11990 [2019-11-20 05:32:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-20 05:32:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1173. [2019-11-20 05:32:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-11-20 05:32:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1363 transitions. [2019-11-20 05:32:26,695 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1363 transitions. Word has length 109 [2019-11-20 05:32:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:26,696 INFO L462 AbstractCegarLoop]: Abstraction has 1173 states and 1363 transitions. [2019-11-20 05:32:26,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-20 05:32:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1363 transitions. [2019-11-20 05:32:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 05:32:26,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:26,697 INFO L410 BasicCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:32:26,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:26,900 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -340295162, now seen corresponding path program 2 times [2019-11-20 05:32:26,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:26,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665528026] [2019-11-20 05:32:26,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:32:27,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665528026] [2019-11-20 05:32:27,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376023423] [2019-11-20 05:32:27,816 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:27,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:32:27,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:32:27,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 05:32:27,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 802 proven. 376 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-20 05:32:28,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:32:28,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 19] total 60 [2019-11-20 05:32:28,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285843236] [2019-11-20 05:32:28,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-20 05:32:28,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:28,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-20 05:32:28,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=3113, Unknown=0, NotChecked=0, Total=3660 [2019-11-20 05:32:28,732 INFO L87 Difference]: Start difference. First operand 1173 states and 1363 transitions. Second operand 61 states. [2019-11-20 05:32:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:31,420 INFO L93 Difference]: Finished difference Result 2346 states and 2748 transitions. [2019-11-20 05:32:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-20 05:32:31,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 115 [2019-11-20 05:32:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:31,427 INFO L225 Difference]: With dead ends: 2346 [2019-11-20 05:32:31,427 INFO L226 Difference]: Without dead ends: 1339 [2019-11-20 05:32:31,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2558 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2417, Invalid=10923, Unknown=0, NotChecked=0, Total=13340 [2019-11-20 05:32:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-11-20 05:32:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1261. [2019-11-20 05:32:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2019-11-20 05:32:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1458 transitions. [2019-11-20 05:32:31,543 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1458 transitions. Word has length 115 [2019-11-20 05:32:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:31,544 INFO L462 AbstractCegarLoop]: Abstraction has 1261 states and 1458 transitions. [2019-11-20 05:32:31,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-20 05:32:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1458 transitions. [2019-11-20 05:32:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 05:32:31,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:31,545 INFO L410 BasicCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:32:31,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:31,745 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash -661992994, now seen corresponding path program 3 times [2019-11-20 05:32:31,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:31,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380063986] [2019-11-20 05:32:31,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 0 proven. 1759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:32:32,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380063986] [2019-11-20 05:32:32,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968835888] [2019-11-20 05:32:32,860 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:32,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 05:32:32,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:32:32,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:32:32,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 2 proven. 907 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-11-20 05:32:33,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:32:33,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 5] total 48 [2019-11-20 05:32:33,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224216349] [2019-11-20 05:32:33,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-20 05:32:33,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-20 05:32:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=1941, Unknown=0, NotChecked=0, Total=2352 [2019-11-20 05:32:33,078 INFO L87 Difference]: Start difference. First operand 1261 states and 1458 transitions. Second operand 49 states. [2019-11-20 05:32:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:32:50,756 INFO L93 Difference]: Finished difference Result 4116 states and 4730 transitions. [2019-11-20 05:32:50,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2019-11-20 05:32:50,757 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 121 [2019-11-20 05:32:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:32:50,765 INFO L225 Difference]: With dead ends: 4116 [2019-11-20 05:32:50,766 INFO L226 Difference]: Without dead ends: 4055 [2019-11-20 05:32:50,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61043 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=29831, Invalid=113431, Unknown=0, NotChecked=0, Total=143262 [2019-11-20 05:32:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4055 states. [2019-11-20 05:32:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4055 to 2287. [2019-11-20 05:32:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-11-20 05:32:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2663 transitions. [2019-11-20 05:32:50,945 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2663 transitions. Word has length 121 [2019-11-20 05:32:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:32:50,945 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 2663 transitions. [2019-11-20 05:32:50,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-20 05:32:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2663 transitions. [2019-11-20 05:32:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 05:32:50,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:32:50,947 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 48, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-20 05:32:51,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:51,148 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:32:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:32:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2038057369, now seen corresponding path program 4 times [2019-11-20 05:32:51,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:32:51,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882719321] [2019-11-20 05:32:51,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:32:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:32:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 49 proven. 3948 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:32:52,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882719321] [2019-11-20 05:32:52,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342393359] [2019-11-20 05:32:52,312 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:32:52,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 05:32:52,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:32:52,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-20 05:32:52,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:32:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:32:54,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:32:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 1399 proven. 2177 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-11-20 05:32:54,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:32:54,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 42] total 98 [2019-11-20 05:32:54,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112387782] [2019-11-20 05:32:54,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-11-20 05:32:54,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:32:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-11-20 05:32:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=8477, Unknown=0, NotChecked=0, Total=9506 [2019-11-20 05:32:54,452 INFO L87 Difference]: Start difference. First operand 2287 states and 2663 transitions. Second operand 98 states. [2019-11-20 05:33:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:04,778 INFO L93 Difference]: Finished difference Result 3589 states and 4092 transitions. [2019-11-20 05:33:04,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-11-20 05:33:04,779 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 180 [2019-11-20 05:33:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:04,782 INFO L225 Difference]: With dead ends: 3589 [2019-11-20 05:33:04,782 INFO L226 Difference]: Without dead ends: 1919 [2019-11-20 05:33:04,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20549 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=7831, Invalid=61075, Unknown=0, NotChecked=0, Total=68906 [2019-11-20 05:33:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-11-20 05:33:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1418. [2019-11-20 05:33:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-11-20 05:33:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1625 transitions. [2019-11-20 05:33:04,913 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1625 transitions. Word has length 180 [2019-11-20 05:33:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:04,913 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 1625 transitions. [2019-11-20 05:33:04,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-11-20 05:33:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1625 transitions. [2019-11-20 05:33:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 05:33:04,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:04,915 INFO L410 BasicCegarLoop]: trace histogram [54, 54, 51, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-20 05:33:05,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:05,115 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash -507321356, now seen corresponding path program 5 times [2019-11-20 05:33:05,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:05,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582637835] [2019-11-20 05:33:05,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 39 proven. 4435 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:33:06,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582637835] [2019-11-20 05:33:06,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141022619] [2019-11-20 05:33:06,419 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:06,513 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-11-20 05:33:06,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:06,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 05:33:06,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 2020 proven. 477 refuted. 0 times theorem prover too weak. 1982 trivial. 0 not checked. [2019-11-20 05:33:07,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:07,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 21] total 79 [2019-11-20 05:33:07,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324359023] [2019-11-20 05:33:07,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-11-20 05:33:07,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-11-20 05:33:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=5357, Unknown=0, NotChecked=0, Total=6320 [2019-11-20 05:33:07,183 INFO L87 Difference]: Start difference. First operand 1418 states and 1625 transitions. Second operand 80 states. [2019-11-20 05:33:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:11,071 INFO L93 Difference]: Finished difference Result 3302 states and 3743 transitions. [2019-11-20 05:33:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-11-20 05:33:11,071 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 189 [2019-11-20 05:33:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:11,074 INFO L225 Difference]: With dead ends: 3302 [2019-11-20 05:33:11,074 INFO L226 Difference]: Without dead ends: 2091 [2019-11-20 05:33:11,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6387 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5500, Invalid=18680, Unknown=0, NotChecked=0, Total=24180 [2019-11-20 05:33:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-11-20 05:33:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1514. [2019-11-20 05:33:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2019-11-20 05:33:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1730 transitions. [2019-11-20 05:33:11,291 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1730 transitions. Word has length 189 [2019-11-20 05:33:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:11,291 INFO L462 AbstractCegarLoop]: Abstraction has 1514 states and 1730 transitions. [2019-11-20 05:33:11,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-11-20 05:33:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1730 transitions. [2019-11-20 05:33:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 05:33:11,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:11,293 INFO L410 BasicCegarLoop]: trace histogram [57, 57, 54, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-20 05:33:11,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:11,494 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -749482745, now seen corresponding path program 6 times [2019-11-20 05:33:11,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:11,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994834461] [2019-11-20 05:33:11,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 29 proven. 4949 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:33:13,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994834461] [2019-11-20 05:33:13,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766943783] [2019-11-20 05:33:13,283 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:13,322 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-20 05:33:13,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:13,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 05:33:13,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:33:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:33:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 2313 proven. 1 refuted. 0 times theorem prover too weak. 2669 trivial. 0 not checked. [2019-11-20 05:33:13,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:13,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 8] total 70 [2019-11-20 05:33:13,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581893332] [2019-11-20 05:33:13,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-20 05:33:13,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:13,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-20 05:33:13,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=4136, Unknown=0, NotChecked=0, Total=4830 [2019-11-20 05:33:13,616 INFO L87 Difference]: Start difference. First operand 1514 states and 1730 transitions. Second operand 70 states. [2019-11-20 05:33:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:32,463 INFO L93 Difference]: Finished difference Result 3046 states and 3308 transitions. [2019-11-20 05:33:32,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 283 states. [2019-11-20 05:33:32,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 198 [2019-11-20 05:33:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:32,469 INFO L225 Difference]: With dead ends: 3046 [2019-11-20 05:33:32,469 INFO L226 Difference]: Without dead ends: 624 [2019-11-20 05:33:32,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42908 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=28766, Invalid=94084, Unknown=0, NotChecked=0, Total=122850 [2019-11-20 05:33:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-20 05:33:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 295. [2019-11-20 05:33:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-20 05:33:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 310 transitions. [2019-11-20 05:33:32,498 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 310 transitions. Word has length 198 [2019-11-20 05:33:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:32,498 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 310 transitions. [2019-11-20 05:33:32,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-20 05:33:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 310 transitions. [2019-11-20 05:33:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 05:33:32,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:32,499 INFO L410 BasicCegarLoop]: trace histogram [57, 57, 57, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:33:32,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:32,699 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1624907463, now seen corresponding path program 4 times [2019-11-20 05:33:32,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:32,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034713102] [2019-11-20 05:33:32,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 4 proven. 3915 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2019-11-20 05:33:33,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034713102] [2019-11-20 05:33:33,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124043893] [2019-11-20 05:33:33,300 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:33,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 05:33:33,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:33,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:33:33,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 2246 proven. 532 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2019-11-20 05:33:33,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:33,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2019-11-20 05:33:33,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950239284] [2019-11-20 05:33:33,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-20 05:33:33,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:33,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-20 05:33:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2019-11-20 05:33:33,959 INFO L87 Difference]: Start difference. First operand 295 states and 310 transitions. Second operand 48 states. [2019-11-20 05:33:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:36,370 INFO L93 Difference]: Finished difference Result 688 states and 730 transitions. [2019-11-20 05:33:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-20 05:33:36,370 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 198 [2019-11-20 05:33:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:36,371 INFO L225 Difference]: With dead ends: 688 [2019-11-20 05:33:36,371 INFO L226 Difference]: Without dead ends: 395 [2019-11-20 05:33:36,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3390, Invalid=9042, Unknown=0, NotChecked=0, Total=12432 [2019-11-20 05:33:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-20 05:33:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 313. [2019-11-20 05:33:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-20 05:33:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 330 transitions. [2019-11-20 05:33:36,403 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 330 transitions. Word has length 198 [2019-11-20 05:33:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:36,403 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 330 transitions. [2019-11-20 05:33:36,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-20 05:33:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 330 transitions. [2019-11-20 05:33:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 05:33:36,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:36,405 INFO L410 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 05:33:36,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:36,608 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash -723137398, now seen corresponding path program 5 times [2019-11-20 05:33:36,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:36,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975777429] [2019-11-20 05:33:36,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-11-20 05:33:36,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975777429] [2019-11-20 05:33:36,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509124456] [2019-11-20 05:33:36,747 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:36,862 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-11-20 05:33:36,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:36,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 05:33:36,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 574 proven. 3760 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2019-11-20 05:33:37,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:37,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 28] total 33 [2019-11-20 05:33:37,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749127589] [2019-11-20 05:33:37,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-20 05:33:37,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-20 05:33:37,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=726, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 05:33:37,516 INFO L87 Difference]: Start difference. First operand 313 states and 330 transitions. Second operand 33 states. [2019-11-20 05:33:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:37,931 INFO L93 Difference]: Finished difference Result 521 states and 543 transitions. [2019-11-20 05:33:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 05:33:37,931 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 207 [2019-11-20 05:33:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:37,932 INFO L225 Difference]: With dead ends: 521 [2019-11-20 05:33:37,932 INFO L226 Difference]: Without dead ends: 449 [2019-11-20 05:33:37,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=1766, Unknown=0, NotChecked=0, Total=2756 [2019-11-20 05:33:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-20 05:33:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 381. [2019-11-20 05:33:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-20 05:33:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 399 transitions. [2019-11-20 05:33:37,979 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 399 transitions. Word has length 207 [2019-11-20 05:33:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:37,979 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 399 transitions. [2019-11-20 05:33:37,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-20 05:33:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 399 transitions. [2019-11-20 05:33:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 05:33:37,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:37,981 INFO L410 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-11-20 05:33:38,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:38,184 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1395962766, now seen corresponding path program 6 times [2019-11-20 05:33:38,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:38,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382464216] [2019-11-20 05:33:38,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2019-11-20 05:33:38,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382464216] [2019-11-20 05:33:38,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684807076] [2019-11-20 05:33:38,382 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:38,564 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2019-11-20 05:33:38,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:38,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:33:38,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2019-11-20 05:33:38,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:38,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 05:33:38,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168917041] [2019-11-20 05:33:38,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:33:38,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:33:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:33:38,736 INFO L87 Difference]: Start difference. First operand 381 states and 399 transitions. Second operand 13 states. [2019-11-20 05:33:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:38,867 INFO L93 Difference]: Finished difference Result 588 states and 611 transitions. [2019-11-20 05:33:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:33:38,867 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 275 [2019-11-20 05:33:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:38,868 INFO L225 Difference]: With dead ends: 588 [2019-11-20 05:33:38,868 INFO L226 Difference]: Without dead ends: 516 [2019-11-20 05:33:38,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:33:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-20 05:33:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 449. [2019-11-20 05:33:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-20 05:33:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 468 transitions. [2019-11-20 05:33:38,909 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 468 transitions. Word has length 275 [2019-11-20 05:33:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:38,909 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 468 transitions. [2019-11-20 05:33:38,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:33:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 468 transitions. [2019-11-20 05:33:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-20 05:33:38,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:38,911 INFO L410 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2019-11-20 05:33:39,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:39,112 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:39,112 INFO L82 PathProgramCache]: Analyzing trace with hash -398042990, now seen corresponding path program 7 times [2019-11-20 05:33:39,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:39,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122758295] [2019-11-20 05:33:39,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-11-20 05:33:39,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122758295] [2019-11-20 05:33:39,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474069738] [2019-11-20 05:33:39,423 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:39,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:33:39,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-11-20 05:33:39,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:39,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-20 05:33:39,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601840006] [2019-11-20 05:33:39,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 05:33:39,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 05:33:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:33:39,816 INFO L87 Difference]: Start difference. First operand 449 states and 468 transitions. Second operand 15 states. [2019-11-20 05:33:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:39,912 INFO L93 Difference]: Finished difference Result 656 states and 680 transitions. [2019-11-20 05:33:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 05:33:39,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-11-20 05:33:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:39,913 INFO L225 Difference]: With dead ends: 656 [2019-11-20 05:33:39,913 INFO L226 Difference]: Without dead ends: 584 [2019-11-20 05:33:39,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:33:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-20 05:33:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 517. [2019-11-20 05:33:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-20 05:33:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 537 transitions. [2019-11-20 05:33:39,977 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 537 transitions. Word has length 343 [2019-11-20 05:33:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:39,978 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 537 transitions. [2019-11-20 05:33:39,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 05:33:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 537 transitions. [2019-11-20 05:33:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-11-20 05:33:39,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:39,979 INFO L410 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2019-11-20 05:33:40,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:40,180 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash -610550890, now seen corresponding path program 8 times [2019-11-20 05:33:40,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:40,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039500514] [2019-11-20 05:33:40,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-11-20 05:33:40,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039500514] [2019-11-20 05:33:40,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541635075] [2019-11-20 05:33:40,530 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:40,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:33:40,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:40,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 05:33:40,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-11-20 05:33:41,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:41,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-20 05:33:41,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375750166] [2019-11-20 05:33:41,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 05:33:41,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 05:33:41,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:33:41,064 INFO L87 Difference]: Start difference. First operand 517 states and 537 transitions. Second operand 17 states. [2019-11-20 05:33:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:41,171 INFO L93 Difference]: Finished difference Result 724 states and 749 transitions. [2019-11-20 05:33:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:33:41,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 411 [2019-11-20 05:33:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:41,174 INFO L225 Difference]: With dead ends: 724 [2019-11-20 05:33:41,174 INFO L226 Difference]: Without dead ends: 652 [2019-11-20 05:33:41,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:33:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-11-20 05:33:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 585. [2019-11-20 05:33:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-11-20 05:33:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 606 transitions. [2019-11-20 05:33:41,247 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 606 transitions. Word has length 411 [2019-11-20 05:33:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:41,248 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 606 transitions. [2019-11-20 05:33:41,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 05:33:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 606 transitions. [2019-11-20 05:33:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-11-20 05:33:41,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:41,251 INFO L410 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2019-11-20 05:33:41,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:41,455 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1144380570, now seen corresponding path program 9 times [2019-11-20 05:33:41,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:41,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608011066] [2019-11-20 05:33:41,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-11-20 05:33:41,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608011066] [2019-11-20 05:33:41,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577910418] [2019-11-20 05:33:41,922 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:42,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-11-20 05:33:42,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:42,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:33:42,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-11-20 05:33:42,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:42,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 05:33:42,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43546023] [2019-11-20 05:33:42,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 05:33:42,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 05:33:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:33:42,597 INFO L87 Difference]: Start difference. First operand 585 states and 606 transitions. Second operand 19 states. [2019-11-20 05:33:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:42,732 INFO L93 Difference]: Finished difference Result 792 states and 818 transitions. [2019-11-20 05:33:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 05:33:42,732 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 479 [2019-11-20 05:33:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:42,733 INFO L225 Difference]: With dead ends: 792 [2019-11-20 05:33:42,733 INFO L226 Difference]: Without dead ends: 720 [2019-11-20 05:33:42,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:33:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-20 05:33:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 653. [2019-11-20 05:33:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-11-20 05:33:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 675 transitions. [2019-11-20 05:33:42,787 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 675 transitions. Word has length 479 [2019-11-20 05:33:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:42,787 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 675 transitions. [2019-11-20 05:33:42,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 05:33:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 675 transitions. [2019-11-20 05:33:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-11-20 05:33:42,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:42,790 INFO L410 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2019-11-20 05:33:42,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:42,990 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1217772446, now seen corresponding path program 10 times [2019-11-20 05:33:42,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:42,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415745207] [2019-11-20 05:33:42,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2019-11-20 05:33:43,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415745207] [2019-11-20 05:33:43,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309760083] [2019-11-20 05:33:43,633 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:43,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 05:33:43,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:43,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 05:33:43,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 584 proven. 34950 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-11-20 05:33:45,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:45,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 33] total 43 [2019-11-20 05:33:45,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748691092] [2019-11-20 05:33:45,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-20 05:33:45,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-20 05:33:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1346, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 05:33:45,316 INFO L87 Difference]: Start difference. First operand 653 states and 675 transitions. Second operand 43 states. [2019-11-20 05:33:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:45,841 INFO L93 Difference]: Finished difference Result 861 states and 888 transitions. [2019-11-20 05:33:45,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 05:33:45,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 547 [2019-11-20 05:33:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:45,843 INFO L225 Difference]: With dead ends: 861 [2019-11-20 05:33:45,843 INFO L226 Difference]: Without dead ends: 789 [2019-11-20 05:33:45,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1320, Invalid=2586, Unknown=0, NotChecked=0, Total=3906 [2019-11-20 05:33:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-11-20 05:33:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 721. [2019-11-20 05:33:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-20 05:33:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 744 transitions. [2019-11-20 05:33:45,916 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 744 transitions. Word has length 547 [2019-11-20 05:33:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:45,917 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 744 transitions. [2019-11-20 05:33:45,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-20 05:33:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 744 transitions. [2019-11-20 05:33:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-11-20 05:33:45,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:45,919 INFO L410 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2019-11-20 05:33:46,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:46,120 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1589401762, now seen corresponding path program 11 times [2019-11-20 05:33:46,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:46,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218423185] [2019-11-20 05:33:46,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2019-11-20 05:33:46,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218423185] [2019-11-20 05:33:46,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28968820] [2019-11-20 05:33:46,943 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:47,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2019-11-20 05:33:47,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:47,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 05:33:47,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 586 proven. 44932 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2019-11-20 05:33:48,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:48,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 34] total 45 [2019-11-20 05:33:48,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372563594] [2019-11-20 05:33:48,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-20 05:33:48,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:48,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-20 05:33:48,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1506, Unknown=0, NotChecked=0, Total=1980 [2019-11-20 05:33:48,839 INFO L87 Difference]: Start difference. First operand 721 states and 744 transitions. Second operand 45 states. [2019-11-20 05:33:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:49,794 INFO L93 Difference]: Finished difference Result 929 states and 957 transitions. [2019-11-20 05:33:49,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-20 05:33:49,794 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 615 [2019-11-20 05:33:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:49,796 INFO L225 Difference]: With dead ends: 929 [2019-11-20 05:33:49,796 INFO L226 Difference]: Without dead ends: 857 [2019-11-20 05:33:49,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2509, Invalid=4801, Unknown=0, NotChecked=0, Total=7310 [2019-11-20 05:33:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-11-20 05:33:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 789. [2019-11-20 05:33:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-20 05:33:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 813 transitions. [2019-11-20 05:33:49,901 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 813 transitions. Word has length 615 [2019-11-20 05:33:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:49,901 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 813 transitions. [2019-11-20 05:33:49,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-20 05:33:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 813 transitions. [2019-11-20 05:33:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-20 05:33:49,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:49,908 INFO L410 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2019-11-20 05:33:50,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:50,121 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1943358554, now seen corresponding path program 12 times [2019-11-20 05:33:50,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:50,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014252226] [2019-11-20 05:33:50,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2019-11-20 05:33:50,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014252226] [2019-11-20 05:33:50,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133489451] [2019-11-20 05:33:50,889 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:51,216 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2019-11-20 05:33:51,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:51,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 05:33:51,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2019-11-20 05:33:52,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:52,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-20 05:33:52,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257273016] [2019-11-20 05:33:52,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 05:33:52,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 05:33:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-11-20 05:33:52,075 INFO L87 Difference]: Start difference. First operand 789 states and 813 transitions. Second operand 25 states. [2019-11-20 05:33:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:52,223 INFO L93 Difference]: Finished difference Result 996 states and 1025 transitions. [2019-11-20 05:33:52,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 05:33:52,223 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 683 [2019-11-20 05:33:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:52,225 INFO L225 Difference]: With dead ends: 996 [2019-11-20 05:33:52,225 INFO L226 Difference]: Without dead ends: 924 [2019-11-20 05:33:52,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-11-20 05:33:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-11-20 05:33:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 857. [2019-11-20 05:33:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-11-20 05:33:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 882 transitions. [2019-11-20 05:33:52,299 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 882 transitions. Word has length 683 [2019-11-20 05:33:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:52,300 INFO L462 AbstractCegarLoop]: Abstraction has 857 states and 882 transitions. [2019-11-20 05:33:52,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 05:33:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 882 transitions. [2019-11-20 05:33:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2019-11-20 05:33:52,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:52,304 INFO L410 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2019-11-20 05:33:52,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:52,508 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1511928662, now seen corresponding path program 13 times [2019-11-20 05:33:52,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:52,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768189121] [2019-11-20 05:33:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2019-11-20 05:33:53,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768189121] [2019-11-20 05:33:53,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828115192] [2019-11-20 05:33:53,421 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:53,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 05:33:53,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2019-11-20 05:33:54,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:54,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-20 05:33:54,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184953815] [2019-11-20 05:33:54,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 05:33:54,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 05:33:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-11-20 05:33:54,597 INFO L87 Difference]: Start difference. First operand 857 states and 882 transitions. Second operand 27 states. [2019-11-20 05:33:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:54,791 INFO L93 Difference]: Finished difference Result 1064 states and 1094 transitions. [2019-11-20 05:33:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 05:33:54,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 751 [2019-11-20 05:33:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:54,793 INFO L225 Difference]: With dead ends: 1064 [2019-11-20 05:33:54,793 INFO L226 Difference]: Without dead ends: 992 [2019-11-20 05:33:54,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-11-20 05:33:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-20 05:33:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 925. [2019-11-20 05:33:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-20 05:33:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 951 transitions. [2019-11-20 05:33:54,935 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 951 transitions. Word has length 751 [2019-11-20 05:33:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:54,936 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 951 transitions. [2019-11-20 05:33:54,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 05:33:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 951 transitions. [2019-11-20 05:33:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-11-20 05:33:54,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:54,943 INFO L410 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2019-11-20 05:33:55,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:55,148 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1872583762, now seen corresponding path program 14 times [2019-11-20 05:33:55,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:55,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469946767] [2019-11-20 05:33:55,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-11-20 05:33:56,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469946767] [2019-11-20 05:33:56,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681815666] [2019-11-20 05:33:56,201 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:56,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:33:56,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:56,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 05:33:56,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:33:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-11-20 05:33:57,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:33:57,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-20 05:33:57,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962241987] [2019-11-20 05:33:57,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 05:33:57,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:33:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 05:33:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-11-20 05:33:57,614 INFO L87 Difference]: Start difference. First operand 925 states and 951 transitions. Second operand 29 states. [2019-11-20 05:33:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:33:57,863 INFO L93 Difference]: Finished difference Result 1132 states and 1163 transitions. [2019-11-20 05:33:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 05:33:57,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 819 [2019-11-20 05:33:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:33:57,864 INFO L225 Difference]: With dead ends: 1132 [2019-11-20 05:33:57,864 INFO L226 Difference]: Without dead ends: 1060 [2019-11-20 05:33:57,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-11-20 05:33:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-11-20 05:33:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 993. [2019-11-20 05:33:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-11-20 05:33:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1020 transitions. [2019-11-20 05:33:57,959 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1020 transitions. Word has length 819 [2019-11-20 05:33:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:33:57,959 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1020 transitions. [2019-11-20 05:33:57,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 05:33:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1020 transitions. [2019-11-20 05:33:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-11-20 05:33:57,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:33:57,965 INFO L410 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2019-11-20 05:33:58,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:58,165 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:33:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:33:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2142124210, now seen corresponding path program 15 times [2019-11-20 05:33:58,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:33:58,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875359817] [2019-11-20 05:33:58,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:33:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:33:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-11-20 05:33:59,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875359817] [2019-11-20 05:33:59,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548772277] [2019-11-20 05:33:59,343 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:33:59,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 131 check-sat command(s) [2019-11-20 05:33:59,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:33:59,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 05:33:59,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-11-20 05:34:01,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:01,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-20 05:34:01,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285013092] [2019-11-20 05:34:01,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-20 05:34:01,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 05:34:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-11-20 05:34:01,288 INFO L87 Difference]: Start difference. First operand 993 states and 1020 transitions. Second operand 31 states. [2019-11-20 05:34:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:01,495 INFO L93 Difference]: Finished difference Result 1200 states and 1232 transitions. [2019-11-20 05:34:01,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 05:34:01,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 887 [2019-11-20 05:34:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:01,497 INFO L225 Difference]: With dead ends: 1200 [2019-11-20 05:34:01,497 INFO L226 Difference]: Without dead ends: 1128 [2019-11-20 05:34:01,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-11-20 05:34:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-11-20 05:34:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1061. [2019-11-20 05:34:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-11-20 05:34:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1089 transitions. [2019-11-20 05:34:01,603 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1089 transitions. Word has length 887 [2019-11-20 05:34:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:01,603 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1089 transitions. [2019-11-20 05:34:01,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-20 05:34:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1089 transitions. [2019-11-20 05:34:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-11-20 05:34:01,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:01,610 INFO L410 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1] [2019-11-20 05:34:01,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:01,810 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash 927304630, now seen corresponding path program 16 times [2019-11-20 05:34:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:01,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066700118] [2019-11-20 05:34:01,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2019-11-20 05:34:03,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066700118] [2019-11-20 05:34:03,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169996267] [2019-11-20 05:34:03,155 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:03,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 05:34:03,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:34:03,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 05:34:03,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 596 proven. 113562 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-11-20 05:34:05,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:05,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 39] total 55 [2019-11-20 05:34:05,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729909532] [2019-11-20 05:34:05,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-20 05:34:05,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-20 05:34:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2255, Unknown=0, NotChecked=0, Total=2970 [2019-11-20 05:34:05,560 INFO L87 Difference]: Start difference. First operand 1061 states and 1089 transitions. Second operand 55 states. [2019-11-20 05:34:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:06,138 INFO L93 Difference]: Finished difference Result 1269 states and 1302 transitions. [2019-11-20 05:34:06,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 05:34:06,138 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 955 [2019-11-20 05:34:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:06,139 INFO L225 Difference]: With dead ends: 1269 [2019-11-20 05:34:06,139 INFO L226 Difference]: Without dead ends: 1197 [2019-11-20 05:34:06,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1815, Invalid=3735, Unknown=0, NotChecked=0, Total=5550 [2019-11-20 05:34:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-20 05:34:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1129. [2019-11-20 05:34:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-11-20 05:34:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1158 transitions. [2019-11-20 05:34:06,271 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1158 transitions. Word has length 955 [2019-11-20 05:34:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:06,271 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1158 transitions. [2019-11-20 05:34:06,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-20 05:34:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1158 transitions. [2019-11-20 05:34:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2019-11-20 05:34:06,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:06,278 INFO L410 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2019-11-20 05:34:06,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:06,482 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:06,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1244241082, now seen corresponding path program 17 times [2019-11-20 05:34:06,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:06,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382735961] [2019-11-20 05:34:06,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2019-11-20 05:34:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382735961] [2019-11-20 05:34:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904896359] [2019-11-20 05:34:08,045 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:08,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 153 check-sat command(s) [2019-11-20 05:34:08,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:34:08,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-20 05:34:08,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 598 proven. 131032 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2019-11-20 05:34:11,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:11,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 40] total 57 [2019-11-20 05:34:11,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096958589] [2019-11-20 05:34:11,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-20 05:34:11,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-20 05:34:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=2487, Unknown=0, NotChecked=0, Total=3192 [2019-11-20 05:34:11,194 INFO L87 Difference]: Start difference. First operand 1129 states and 1158 transitions. Second operand 57 states. [2019-11-20 05:34:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:12,667 INFO L93 Difference]: Finished difference Result 1337 states and 1371 transitions. [2019-11-20 05:34:12,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-20 05:34:12,668 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1023 [2019-11-20 05:34:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:12,669 INFO L225 Difference]: With dead ends: 1337 [2019-11-20 05:34:12,669 INFO L226 Difference]: Without dead ends: 1265 [2019-11-20 05:34:12,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4808, Invalid=9234, Unknown=0, NotChecked=0, Total=14042 [2019-11-20 05:34:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-20 05:34:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1197. [2019-11-20 05:34:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-20 05:34:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1227 transitions. [2019-11-20 05:34:12,780 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1227 transitions. Word has length 1023 [2019-11-20 05:34:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:12,781 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1227 transitions. [2019-11-20 05:34:12,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-20 05:34:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1227 transitions. [2019-11-20 05:34:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2019-11-20 05:34:12,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:12,788 INFO L410 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1] [2019-11-20 05:34:12,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:12,988 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:12,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1524329406, now seen corresponding path program 18 times [2019-11-20 05:34:12,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:12,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666167343] [2019-11-20 05:34:12,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2019-11-20 05:34:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666167343] [2019-11-20 05:34:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403302025] [2019-11-20 05:34:14,859 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:15,357 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-11-20 05:34:15,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:34:15,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 05:34:15,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2019-11-20 05:34:17,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:17,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-11-20 05:34:17,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887471108] [2019-11-20 05:34:17,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-20 05:34:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-20 05:34:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 05:34:17,419 INFO L87 Difference]: Start difference. First operand 1197 states and 1227 transitions. Second operand 37 states. [2019-11-20 05:34:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:17,684 INFO L93 Difference]: Finished difference Result 1404 states and 1439 transitions. [2019-11-20 05:34:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 05:34:17,685 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1091 [2019-11-20 05:34:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:17,686 INFO L225 Difference]: With dead ends: 1404 [2019-11-20 05:34:17,686 INFO L226 Difference]: Without dead ends: 1332 [2019-11-20 05:34:17,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 05:34:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2019-11-20 05:34:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1265. [2019-11-20 05:34:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-20 05:34:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1296 transitions. [2019-11-20 05:34:17,803 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1296 transitions. Word has length 1091 [2019-11-20 05:34:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:17,803 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1296 transitions. [2019-11-20 05:34:17,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-20 05:34:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1296 transitions. [2019-11-20 05:34:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2019-11-20 05:34:17,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:17,813 INFO L410 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1] [2019-11-20 05:34:18,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:18,014 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1532754114, now seen corresponding path program 19 times [2019-11-20 05:34:18,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:18,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848288339] [2019-11-20 05:34:18,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2019-11-20 05:34:20,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848288339] [2019-11-20 05:34:20,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302583908] [2019-11-20 05:34:20,002 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:20,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 05:34:20,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2019-11-20 05:34:22,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:22,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-11-20 05:34:22,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430316102] [2019-11-20 05:34:22,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-20 05:34:22,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:22,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-20 05:34:22,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 05:34:22,569 INFO L87 Difference]: Start difference. First operand 1265 states and 1296 transitions. Second operand 39 states. [2019-11-20 05:34:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:22,848 INFO L93 Difference]: Finished difference Result 1472 states and 1508 transitions. [2019-11-20 05:34:22,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 05:34:22,848 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1159 [2019-11-20 05:34:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:22,850 INFO L225 Difference]: With dead ends: 1472 [2019-11-20 05:34:22,850 INFO L226 Difference]: Without dead ends: 1400 [2019-11-20 05:34:22,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1141 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 05:34:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-11-20 05:34:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1333. [2019-11-20 05:34:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-11-20 05:34:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1365 transitions. [2019-11-20 05:34:22,973 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1365 transitions. Word has length 1159 [2019-11-20 05:34:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:22,973 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1365 transitions. [2019-11-20 05:34:22,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-20 05:34:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1365 transitions. [2019-11-20 05:34:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2019-11-20 05:34:22,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:22,984 INFO L410 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1] [2019-11-20 05:34:23,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:23,184 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:23,185 INFO L82 PathProgramCache]: Analyzing trace with hash -852737082, now seen corresponding path program 20 times [2019-11-20 05:34:23,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:23,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541504720] [2019-11-20 05:34:23,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2019-11-20 05:34:25,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541504720] [2019-11-20 05:34:25,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395930096] [2019-11-20 05:34:25,409 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:25,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:34:25,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:34:25,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 05:34:25,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2019-11-20 05:34:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:28,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2019-11-20 05:34:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410118725] [2019-11-20 05:34:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-20 05:34:28,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-20 05:34:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 05:34:28,455 INFO L87 Difference]: Start difference. First operand 1333 states and 1365 transitions. Second operand 41 states. [2019-11-20 05:34:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:28,713 INFO L93 Difference]: Finished difference Result 1540 states and 1577 transitions. [2019-11-20 05:34:28,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 05:34:28,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1227 [2019-11-20 05:34:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:28,715 INFO L225 Difference]: With dead ends: 1540 [2019-11-20 05:34:28,715 INFO L226 Difference]: Without dead ends: 1468 [2019-11-20 05:34:28,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 05:34:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2019-11-20 05:34:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1401. [2019-11-20 05:34:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-20 05:34:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1434 transitions. [2019-11-20 05:34:28,862 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1434 transitions. Word has length 1227 [2019-11-20 05:34:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:28,863 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1434 transitions. [2019-11-20 05:34:28,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-20 05:34:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1434 transitions. [2019-11-20 05:34:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2019-11-20 05:34:28,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:28,872 INFO L410 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1] [2019-11-20 05:34:29,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:29,073 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash 21843146, now seen corresponding path program 21 times [2019-11-20 05:34:29,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:29,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829859676] [2019-11-20 05:34:29,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2019-11-20 05:34:31,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829859676] [2019-11-20 05:34:31,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750503573] [2019-11-20 05:34:31,592 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:32,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 137 check-sat command(s) [2019-11-20 05:34:32,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:34:32,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:34:32,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2019-11-20 05:34:35,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:35,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2019-11-20 05:34:35,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309956151] [2019-11-20 05:34:35,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-20 05:34:35,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:35,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-20 05:34:35,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 05:34:35,275 INFO L87 Difference]: Start difference. First operand 1401 states and 1434 transitions. Second operand 43 states. [2019-11-20 05:34:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:35,569 INFO L93 Difference]: Finished difference Result 1608 states and 1646 transitions. [2019-11-20 05:34:35,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 05:34:35,569 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1295 [2019-11-20 05:34:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:35,571 INFO L225 Difference]: With dead ends: 1608 [2019-11-20 05:34:35,571 INFO L226 Difference]: Without dead ends: 1536 [2019-11-20 05:34:35,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1316 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 05:34:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-11-20 05:34:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1469. [2019-11-20 05:34:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-11-20 05:34:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1503 transitions. [2019-11-20 05:34:35,729 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1503 transitions. Word has length 1295 [2019-11-20 05:34:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:35,729 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 1503 transitions. [2019-11-20 05:34:35,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-20 05:34:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1503 transitions. [2019-11-20 05:34:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2019-11-20 05:34:35,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:35,740 INFO L410 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2019-11-20 05:34:35,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:35,940 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1480594382, now seen corresponding path program 22 times [2019-11-20 05:34:35,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:35,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62919362] [2019-11-20 05:34:35,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:34:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:34:36,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:34:36,690 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:34:37,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:34:37 BoogieIcfgContainer [2019-11-20 05:34:37,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:34:37,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:34:37,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:34:37,012 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:34:37,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:45" (3/4) ... [2019-11-20 05:34:37,015 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:34:37,373 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_432d3c2d-434c-4f1e-8ac1-4a63d7644ca8/bin/uautomizer/witness.graphml [2019-11-20 05:34:37,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:34:37,377 INFO L168 Benchmark]: Toolchain (without parser) took 232385.88 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 944.7 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 05:34:37,378 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:34:37,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:34:37,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:34:37,380 INFO L168 Benchmark]: Boogie Preprocessor took 37.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:34:37,380 INFO L168 Benchmark]: RCFGBuilder took 374.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:34:37,381 INFO L168 Benchmark]: TraceAbstraction took 231300.72 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 05:34:37,381 INFO L168 Benchmark]: Witness Printer took 362.10 ms. Allocated memory is still 3.6 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:34:37,383 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 374.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 231300.72 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 362.10 ms. Allocated memory is still 3.6 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int last ; [L13] int SIZE = 20; VAL [last=0, SIZE=20] [L15] last = __VERIFIER_nondet_int() [L17] int a=0,b=0,c=0,st=0,d=0; VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND TRUE d == SIZE [L33] a = 0 [L34] b = 1 VAL [last=21, SIZE=20] [L6] COND TRUE !(cond) VAL [last=21, SIZE=20] [L7] __VERIFIER_error() VAL [last=21, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 231.2s, OverallIterations: 60, TraceHistogramMax: 400, AutomataDifference: 137.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 738 SDtfs, 26081 SDslu, 6085 SDs, 0 SdLazy, 40465 SolverSat, 6902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19948 GetRequests, 15052 SyntacticMatches, 1 SemanticMatches, 4895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319645 ImplicationChecksByTransitivity, 137.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2287occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 59 MinimizatonAttempts, 15077 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 32789 NumberOfCodeBlocks, 31214 NumberOfCodeBlocksAsserted, 1072 NumberOfCheckSat, 31314 ConstructedInterpolants, 0 QuantifiedInterpolants, 139860144 SizeOfPredicates, 174 NumberOfNonLiveVariables, 23025 ConjunctsInSsa, 865 ConjunctsInUnsatCore, 112 InterpolantComputations, 11 PerfectInterpolantSequences, 252581/3139181 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...