./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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 747981090a474d9d2269aea1ffd03eef2ddc8848 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-11-15 22:09:30,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:09:30,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:09:30,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:09:30,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:09:30,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:09:30,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:09:30,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:09:30,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:09:30,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:09:30,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:09:30,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:09:30,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:09:30,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:09:30,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:09:30,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:09:30,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:09:30,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:09:30,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:09:30,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:09:30,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:09:30,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:09:30,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:09:30,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:09:30,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:09:30,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:09:30,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:09:30,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:09:30,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:09:30,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:09:30,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:09:30,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:09:30,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:09:30,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:09:30,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:09:30,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:09:30,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:09:30,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:09:30,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:09:30,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:09:30,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:09:30,899 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:09:30,923 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:09:30,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:09:30,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:09:30,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:09:30,935 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:09:30,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:09:30,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:09:30,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:09:30,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:09:30,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:09:30,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:09:30,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:09:30,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:09:30,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:09:30,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:09:30,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:09:30,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:09:30,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:09:30,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:09:30,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:09:30,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:09:30,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:09:30,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:09:30,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:09:30,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:09:30,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:09:30,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:09:30,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:09:30,942 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_031995c2-6cfb-40ba-b487-16845a461aa4/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 -> 747981090a474d9d2269aea1ffd03eef2ddc8848 [2019-11-15 22:09:30,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:09:30,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:09:30,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:09:30,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:09:30,994 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:09:30,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2019-11-15 22:09:31,054 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/data/56286089b/2afea0882ea045f2bc96f765134edf4d/FLAG7501c119b [2019-11-15 22:09:31,524 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:09:31,531 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2019-11-15 22:09:31,548 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/data/56286089b/2afea0882ea045f2bc96f765134edf4d/FLAG7501c119b [2019-11-15 22:09:31,870 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/data/56286089b/2afea0882ea045f2bc96f765134edf4d [2019-11-15 22:09:31,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:09:31,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:09:31,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:09:31,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:09:31,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:09:31,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:09:31" (1/1) ... [2019-11-15 22:09:31,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451d7634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:31, skipping insertion in model container [2019-11-15 22:09:31,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:09:31" (1/1) ... [2019-11-15 22:09:31,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:09:31,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:09:32,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:09:32,262 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:09:32,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:09:32,389 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:09:32,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32 WrapperNode [2019-11-15 22:09:32,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:09:32,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:09:32,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:09:32,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:09:32,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:09:32,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:09:32,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:09:32,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:09:32,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... [2019-11-15 22:09:32,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:09:32,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:09:32,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:09:32,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:09:32,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:09:32,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:09:33,477 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:09:33,478 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 22:09:33,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:09:33 BoogieIcfgContainer [2019-11-15 22:09:33,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:09:33,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:09:33,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:09:33,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:09:33,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:09:31" (1/3) ... [2019-11-15 22:09:33,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331da0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:09:33, skipping insertion in model container [2019-11-15 22:09:33,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:09:32" (2/3) ... [2019-11-15 22:09:33,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331da0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:09:33, skipping insertion in model container [2019-11-15 22:09:33,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:09:33" (3/3) ... [2019-11-15 22:09:33,487 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-11-15 22:09:33,496 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:09:33,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:09:33,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:09:33,554 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:09:33,555 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:09:33,555 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:09:33,555 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:09:33,555 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:09:33,555 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:09:33,555 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:09:33,555 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:09:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-15 22:09:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:09:33,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:33,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:33,589 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2019-11-15 22:09:33,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:33,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257972856] [2019-11-15 22:09:33,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:33,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:33,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:33,753 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-15 22:09:33,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257972856] [2019-11-15 22:09:33,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:33,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:09:33,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464092472] [2019-11-15 22:09:33,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:09:33,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:09:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:09:33,771 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-15 22:09:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:33,799 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2019-11-15 22:09:33,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:09:33,800 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 22:09:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:33,811 INFO L225 Difference]: With dead ends: 218 [2019-11-15 22:09:33,812 INFO L226 Difference]: Without dead ends: 106 [2019-11-15 22:09:33,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:09:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-15 22:09:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-15 22:09:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 22:09:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2019-11-15 22:09:33,856 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2019-11-15 22:09:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:33,857 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2019-11-15 22:09:33,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:09:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2019-11-15 22:09:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:09:33,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:33,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:33,858 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2019-11-15 22:09:33,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:33,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88382412] [2019-11-15 22:09:33,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:33,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:33,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:33,903 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-15 22:09:33,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88382412] [2019-11-15 22:09:33,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:33,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:33,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554124897] [2019-11-15 22:09:33,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:33,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:33,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:33,906 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2019-11-15 22:09:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:33,975 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2019-11-15 22:09:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:33,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 22:09:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:33,978 INFO L225 Difference]: With dead ends: 214 [2019-11-15 22:09:33,978 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 22:09:33,979 INFO L600 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-15 22:09:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 22:09:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-15 22:09:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:09:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2019-11-15 22:09:33,997 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2019-11-15 22:09:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:33,997 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2019-11-15 22:09:33,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2019-11-15 22:09:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:09:33,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:33,999 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:33,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2019-11-15 22:09:33,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:34,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390396318] [2019-11-15 22:09:34,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:34,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:34,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:34,435 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2019-11-15 22:09:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:34,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390396318] [2019-11-15 22:09:34,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:34,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:09:34,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193615705] [2019-11-15 22:09:34,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:09:34,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:09:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:09:34,451 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 4 states. [2019-11-15 22:09:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:34,881 INFO L93 Difference]: Finished difference Result 326 states and 541 transitions. [2019-11-15 22:09:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:09:34,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-15 22:09:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:34,885 INFO L225 Difference]: With dead ends: 326 [2019-11-15 22:09:34,885 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:09:34,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:09:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:09:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-11-15 22:09:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-15 22:09:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2019-11-15 22:09:34,905 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2019-11-15 22:09:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:34,906 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2019-11-15 22:09:34,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:09:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2019-11-15 22:09:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:09:34,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:34,907 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:34,908 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2019-11-15 22:09:34,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:34,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528706524] [2019-11-15 22:09:34,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:34,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:34,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:34,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528706524] [2019-11-15 22:09:34,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:34,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:34,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639223124] [2019-11-15 22:09:34,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:34,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:34,970 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2019-11-15 22:09:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:35,018 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2019-11-15 22:09:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:35,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 22:09:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:35,020 INFO L225 Difference]: With dead ends: 314 [2019-11-15 22:09:35,021 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 22:09:35,022 INFO L600 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-15 22:09:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 22:09:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-11-15 22:09:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 22:09:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2019-11-15 22:09:35,032 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2019-11-15 22:09:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:35,032 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2019-11-15 22:09:35,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2019-11-15 22:09:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:09:35,034 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:35,034 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:35,034 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2019-11-15 22:09:35,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:35,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565564896] [2019-11-15 22:09:35,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:35,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:35,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:09:35,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565564896] [2019-11-15 22:09:35,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:35,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:35,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223897854] [2019-11-15 22:09:35,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:35,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:35,088 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2019-11-15 22:09:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:35,132 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2019-11-15 22:09:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:35,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 22:09:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:35,134 INFO L225 Difference]: With dead ends: 243 [2019-11-15 22:09:35,134 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 22:09:35,135 INFO L600 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-15 22:09:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 22:09:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-11-15 22:09:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 22:09:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2019-11-15 22:09:35,144 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2019-11-15 22:09:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:35,144 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2019-11-15 22:09:35,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2019-11-15 22:09:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:09:35,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:35,146 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:35,147 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2019-11-15 22:09:35,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:35,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041000508] [2019-11-15 22:09:35,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:35,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:35,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:35,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041000508] [2019-11-15 22:09:35,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118101313] [2019-11-15 22:09:35,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:35,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:09:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:35,339 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:35,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 22:09:35,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059310613] [2019-11-15 22:09:35,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:09:35,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:09:35,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:09:35,346 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2019-11-15 22:09:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:35,566 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2019-11-15 22:09:35,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:09:35,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-15 22:09:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:35,568 INFO L225 Difference]: With dead ends: 204 [2019-11-15 22:09:35,568 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 22:09:35,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:09:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 22:09:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2019-11-15 22:09:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-15 22:09:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2019-11-15 22:09:35,589 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2019-11-15 22:09:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:35,590 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2019-11-15 22:09:35,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:09:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2019-11-15 22:09:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:09:35,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:35,591 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:35,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:35,798 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2019-11-15 22:09:35,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:35,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762595765] [2019-11-15 22:09:35,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:35,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:35,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:35,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762595765] [2019-11-15 22:09:35,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173351660] [2019-11-15 22:09:35,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:36,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:09:36,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:36,110 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:36,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-15 22:09:36,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224682138] [2019-11-15 22:09:36,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:09:36,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:09:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:09:36,112 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 6 states. [2019-11-15 22:09:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:36,310 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2019-11-15 22:09:36,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:09:36,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-15 22:09:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:36,313 INFO L225 Difference]: With dead ends: 387 [2019-11-15 22:09:36,313 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 22:09:36,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:09:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 22:09:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-11-15 22:09:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-15 22:09:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2019-11-15 22:09:36,323 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2019-11-15 22:09:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:36,323 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2019-11-15 22:09:36,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:09:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2019-11-15 22:09:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:09:36,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:36,325 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:36,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:36,535 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2019-11-15 22:09:36,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:36,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867699967] [2019-11-15 22:09:36,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:36,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:36,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:09:36,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867699967] [2019-11-15 22:09:36,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:36,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:36,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86235884] [2019-11-15 22:09:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:36,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:36,576 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2019-11-15 22:09:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:36,611 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2019-11-15 22:09:36,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:36,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 22:09:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:36,615 INFO L225 Difference]: With dead ends: 409 [2019-11-15 22:09:36,615 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:09:36,615 INFO L600 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-15 22:09:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:09:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-11-15 22:09:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-15 22:09:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2019-11-15 22:09:36,622 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2019-11-15 22:09:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:36,622 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2019-11-15 22:09:36,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2019-11-15 22:09:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:09:36,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:36,624 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:36,624 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2019-11-15 22:09:36,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:36,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650772708] [2019-11-15 22:09:36,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:36,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:36,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:09:36,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650772708] [2019-11-15 22:09:36,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:36,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:36,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134774000] [2019-11-15 22:09:36,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:36,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:36,686 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2019-11-15 22:09:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:36,716 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-11-15 22:09:36,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:36,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 22:09:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:36,719 INFO L225 Difference]: With dead ends: 375 [2019-11-15 22:09:36,719 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:09:36,719 INFO L600 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-15 22:09:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:09:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-11-15 22:09:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-15 22:09:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2019-11-15 22:09:36,726 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2019-11-15 22:09:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:36,727 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2019-11-15 22:09:36,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2019-11-15 22:09:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:09:36,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:36,736 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:36,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:36,736 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2019-11-15 22:09:36,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:36,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877804756] [2019-11-15 22:09:36,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:36,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:36,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:09:36,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877804756] [2019-11-15 22:09:36,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447686621] [2019-11-15 22:09:36,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:36,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:09:36,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:09:37,047 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:37,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2019-11-15 22:09:37,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908834059] [2019-11-15 22:09:37,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:09:37,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:09:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:09:37,049 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 5 states. [2019-11-15 22:09:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:37,327 INFO L93 Difference]: Finished difference Result 485 states and 762 transitions. [2019-11-15 22:09:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:09:37,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-15 22:09:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:37,329 INFO L225 Difference]: With dead ends: 485 [2019-11-15 22:09:37,329 INFO L226 Difference]: Without dead ends: 270 [2019-11-15 22:09:37,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:09:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-15 22:09:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2019-11-15 22:09:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:09:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2019-11-15 22:09:37,338 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2019-11-15 22:09:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:37,338 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2019-11-15 22:09:37,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:09:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2019-11-15 22:09:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:09:37,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:37,339 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:37,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:37,550 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2019-11-15 22:09:37,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:37,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961059089] [2019-11-15 22:09:37,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:37,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:37,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:09:37,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961059089] [2019-11-15 22:09:37,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708262464] [2019-11-15 22:09:37,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:37,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:09:37,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:09:37,681 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:37,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:09:37,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624460449] [2019-11-15 22:09:37,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:09:37,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:09:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:09:37,682 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2019-11-15 22:09:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:37,828 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2019-11-15 22:09:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:09:37,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 22:09:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:37,830 INFO L225 Difference]: With dead ends: 274 [2019-11-15 22:09:37,830 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 22:09:37,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:09:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 22:09:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-15 22:09:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-15 22:09:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-11-15 22:09:37,838 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2019-11-15 22:09:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:37,838 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-11-15 22:09:37,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:09:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-11-15 22:09:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:09:37,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:37,839 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:38,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:38,042 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2019-11-15 22:09:38,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:38,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414257608] [2019-11-15 22:09:38,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:38,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:38,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414257608] [2019-11-15 22:09:38,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884782199] [2019-11-15 22:09:38,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:38,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:09:38,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:38,377 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:38,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-15 22:09:38,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223213511] [2019-11-15 22:09:38,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:09:38,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:09:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:09:38,378 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 6 states. [2019-11-15 22:09:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:38,591 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2019-11-15 22:09:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:09:38,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-15 22:09:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:38,594 INFO L225 Difference]: With dead ends: 271 [2019-11-15 22:09:38,594 INFO L226 Difference]: Without dead ends: 269 [2019-11-15 22:09:38,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:09:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-15 22:09:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2019-11-15 22:09:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-15 22:09:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2019-11-15 22:09:38,606 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2019-11-15 22:09:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:38,608 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2019-11-15 22:09:38,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:09:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2019-11-15 22:09:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:09:38,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:38,609 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:38,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:38,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2019-11-15 22:09:38,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:38,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020126385] [2019-11-15 22:09:38,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:38,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:38,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:09:38,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020126385] [2019-11-15 22:09:38,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:38,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:38,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475407524] [2019-11-15 22:09:38,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:38,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:38,854 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2019-11-15 22:09:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:38,887 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-11-15 22:09:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:38,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-15 22:09:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:38,890 INFO L225 Difference]: With dead ends: 461 [2019-11-15 22:09:38,890 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 22:09:38,891 INFO L600 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-15 22:09:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 22:09:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-15 22:09:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-15 22:09:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2019-11-15 22:09:38,898 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2019-11-15 22:09:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:38,899 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2019-11-15 22:09:38,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2019-11-15 22:09:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 22:09:38,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:38,900 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:38,901 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2019-11-15 22:09:38,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:38,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535160105] [2019-11-15 22:09:38,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:38,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:38,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 22:09:38,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535160105] [2019-11-15 22:09:38,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:38,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:09:38,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206445160] [2019-11-15 22:09:38,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:09:38,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:09:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:09:38,958 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2019-11-15 22:09:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:38,990 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2019-11-15 22:09:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:09:38,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-15 22:09:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:38,992 INFO L225 Difference]: With dead ends: 333 [2019-11-15 22:09:38,992 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:09:38,992 INFO L600 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-15 22:09:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:09:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2019-11-15 22:09:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-15 22:09:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2019-11-15 22:09:38,999 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2019-11-15 22:09:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:38,999 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2019-11-15 22:09:38,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:09:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2019-11-15 22:09:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:09:39,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:39,001 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:39,001 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2019-11-15 22:09:39,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:39,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4735922] [2019-11-15 22:09:39,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:39,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:39,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:09:39,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4735922] [2019-11-15 22:09:39,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074814078] [2019-11-15 22:09:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:39,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:09:39,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:09:39,249 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:39,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 22:09:39,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780019162] [2019-11-15 22:09:39,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:09:39,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:09:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:09:39,251 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2019-11-15 22:09:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:39,349 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2019-11-15 22:09:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:09:39,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-15 22:09:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:39,351 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:09:39,351 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 22:09:39,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:09:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 22:09:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-11-15 22:09:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-15 22:09:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2019-11-15 22:09:39,362 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2019-11-15 22:09:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:39,362 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2019-11-15 22:09:39,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:09:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2019-11-15 22:09:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:09:39,363 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:39,363 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:39,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:39,567 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2019-11-15 22:09:39,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:39,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135615369] [2019-11-15 22:09:39,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:39,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:39,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:39,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135615369] [2019-11-15 22:09:39,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917956958] [2019-11-15 22:09:39,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:09:39,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:39,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:39,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-15 22:09:39,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171792546] [2019-11-15 22:09:39,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:09:39,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:39,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:09:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:39,974 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 9 states. [2019-11-15 22:09:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:40,121 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2019-11-15 22:09:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:09:40,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-15 22:09:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:40,123 INFO L225 Difference]: With dead ends: 193 [2019-11-15 22:09:40,123 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 22:09:40,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 22:09:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-11-15 22:09:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-15 22:09:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2019-11-15 22:09:40,132 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2019-11-15 22:09:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:40,132 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2019-11-15 22:09:40,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:09:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2019-11-15 22:09:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:09:40,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:40,133 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:40,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:40,334 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2019-11-15 22:09:40,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:40,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789498413] [2019-11-15 22:09:40,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:40,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:40,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:40,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789498413] [2019-11-15 22:09:40,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990156604] [2019-11-15 22:09:40,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:40,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:09:40,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:40,862 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:40,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 22:09:40,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428165733] [2019-11-15 22:09:40,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:09:40,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:09:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:40,866 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 9 states. [2019-11-15 22:09:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:41,201 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2019-11-15 22:09:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:09:41,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-11-15 22:09:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:41,203 INFO L225 Difference]: With dead ends: 194 [2019-11-15 22:09:41,204 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 22:09:41,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 22:09:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-15 22:09:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-15 22:09:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2019-11-15 22:09:41,210 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2019-11-15 22:09:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:41,210 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2019-11-15 22:09:41,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:09:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2019-11-15 22:09:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:09:41,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:41,211 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:41,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:41,412 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2019-11-15 22:09:41,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:41,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838290349] [2019-11-15 22:09:41,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:41,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:41,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:41,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838290349] [2019-11-15 22:09:41,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919494955] [2019-11-15 22:09:41,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:41,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:09:41,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:41,934 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:41,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-15 22:09:41,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615623667] [2019-11-15 22:09:41,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:09:41,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:09:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:09:41,936 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 14 states. [2019-11-15 22:09:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:42,251 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2019-11-15 22:09:42,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:09:42,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-11-15 22:09:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:42,252 INFO L225 Difference]: With dead ends: 301 [2019-11-15 22:09:42,253 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:09:42,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:09:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:09:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-15 22:09:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-15 22:09:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2019-11-15 22:09:42,259 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2019-11-15 22:09:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:42,259 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2019-11-15 22:09:42,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:09:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2019-11-15 22:09:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:09:42,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:42,260 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:42,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:42,467 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2019-11-15 22:09:42,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:42,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012115779] [2019-11-15 22:09:42,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:42,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:42,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:09:42,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012115779] [2019-11-15 22:09:42,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152812579] [2019-11-15 22:09:42,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:42,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:09:42,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:09:42,754 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:42,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2019-11-15 22:09:42,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232189843] [2019-11-15 22:09:42,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:09:42,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:09:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:09:42,757 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 7 states. [2019-11-15 22:09:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:42,902 INFO L93 Difference]: Finished difference Result 324 states and 466 transitions. [2019-11-15 22:09:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:09:42,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-15 22:09:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:42,905 INFO L225 Difference]: With dead ends: 324 [2019-11-15 22:09:42,905 INFO L226 Difference]: Without dead ends: 234 [2019-11-15 22:09:42,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:09:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-15 22:09:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-11-15 22:09:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:09:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2019-11-15 22:09:42,913 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2019-11-15 22:09:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:42,913 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2019-11-15 22:09:42,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:09:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2019-11-15 22:09:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:09:42,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:42,915 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:43,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:43,127 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2019-11-15 22:09:43,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:43,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730752750] [2019-11-15 22:09:43,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:43,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:43,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:43,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730752750] [2019-11-15 22:09:43,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192141273] [2019-11-15 22:09:43,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:43,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:09:43,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:43,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:43,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 22:09:43,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775755026] [2019-11-15 22:09:43,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:09:43,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:43,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:09:43,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:43,652 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 9 states. [2019-11-15 22:09:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:43,850 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2019-11-15 22:09:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:09:43,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-11-15 22:09:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:43,852 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:09:43,852 INFO L226 Difference]: Without dead ends: 231 [2019-11-15 22:09:43,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-15 22:09:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-15 22:09:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-15 22:09:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-11-15 22:09:43,860 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2019-11-15 22:09:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-11-15 22:09:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:09:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-11-15 22:09:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:09:43,862 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:43,862 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:44,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:44,062 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2019-11-15 22:09:44,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:44,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125538415] [2019-11-15 22:09:44,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:44,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:44,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:09:44,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125538415] [2019-11-15 22:09:44,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941386435] [2019-11-15 22:09:44,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:44,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:09:44,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:09:44,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:44,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 22:09:44,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595212528] [2019-11-15 22:09:44,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:09:44,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:09:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:09:44,365 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2019-11-15 22:09:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:44,539 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2019-11-15 22:09:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:09:44,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-15 22:09:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:44,541 INFO L225 Difference]: With dead ends: 364 [2019-11-15 22:09:44,541 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:09:44,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:09:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:09:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2019-11-15 22:09:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-15 22:09:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2019-11-15 22:09:44,550 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2019-11-15 22:09:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:44,550 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2019-11-15 22:09:44,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:09:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2019-11-15 22:09:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:09:44,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:44,554 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:44,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:44,758 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2019-11-15 22:09:44,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:44,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622138164] [2019-11-15 22:09:44,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:44,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:44,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:45,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622138164] [2019-11-15 22:09:45,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545119859] [2019-11-15 22:09:45,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:45,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 22:09:45,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:45,262 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:45,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-15 22:09:45,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103813998] [2019-11-15 22:09:45,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:09:45,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:09:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:09:45,264 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 17 states. [2019-11-15 22:09:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:45,536 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2019-11-15 22:09:45,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:09:45,536 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-11-15 22:09:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:45,538 INFO L225 Difference]: With dead ends: 271 [2019-11-15 22:09:45,538 INFO L226 Difference]: Without dead ends: 269 [2019-11-15 22:09:45,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:09:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-15 22:09:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-11-15 22:09:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-15 22:09:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2019-11-15 22:09:45,546 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2019-11-15 22:09:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:45,546 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2019-11-15 22:09:45,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:09:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2019-11-15 22:09:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 22:09:45,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:45,548 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:45,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:45,748 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2019-11-15 22:09:45,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:45,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842241164] [2019-11-15 22:09:45,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:45,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:45,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:46,185 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2019-11-15 22:09:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:46,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842241164] [2019-11-15 22:09:46,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727050552] [2019-11-15 22:09:46,261 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:46,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:46,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:46,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 22:09:46,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:46,510 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:46,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-15 22:09:46,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599525830] [2019-11-15 22:09:46,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:09:46,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:09:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:09:46,513 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 13 states. [2019-11-15 22:09:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:47,014 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2019-11-15 22:09:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:09:47,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-11-15 22:09:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:47,017 INFO L225 Difference]: With dead ends: 272 [2019-11-15 22:09:47,017 INFO L226 Difference]: Without dead ends: 270 [2019-11-15 22:09:47,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:09:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-15 22:09:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-11-15 22:09:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-15 22:09:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2019-11-15 22:09:47,026 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2019-11-15 22:09:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:47,026 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2019-11-15 22:09:47,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:09:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2019-11-15 22:09:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 22:09:47,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:47,028 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:47,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:47,233 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2019-11-15 22:09:47,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:47,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841429500] [2019-11-15 22:09:47,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:47,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:47,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:47,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841429500] [2019-11-15 22:09:47,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533933599] [2019-11-15 22:09:47,601 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:47,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:47,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:47,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:09:47,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:47,984 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:47,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-15 22:09:47,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008769992] [2019-11-15 22:09:47,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:09:47,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:09:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:09:47,986 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 22 states. [2019-11-15 22:09:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:48,321 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2019-11-15 22:09:48,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:09:48,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2019-11-15 22:09:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:48,323 INFO L225 Difference]: With dead ends: 379 [2019-11-15 22:09:48,323 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:09:48,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:09:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:09:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-15 22:09:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-15 22:09:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2019-11-15 22:09:48,331 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2019-11-15 22:09:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:48,332 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2019-11-15 22:09:48,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:09:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2019-11-15 22:09:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 22:09:48,333 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:48,333 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:48,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:48,534 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2019-11-15 22:09:48,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:48,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672204745] [2019-11-15 22:09:48,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:48,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:48,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:09:48,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672204745] [2019-11-15 22:09:48,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483446228] [2019-11-15 22:09:48,701 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:48,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:48,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:48,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:09:48,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:09:48,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:48,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2019-11-15 22:09:48,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541744622] [2019-11-15 22:09:48,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:09:48,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:09:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:48,946 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 9 states. [2019-11-15 22:09:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:49,270 INFO L93 Difference]: Finished difference Result 402 states and 573 transitions. [2019-11-15 22:09:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:09:49,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-11-15 22:09:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:49,273 INFO L225 Difference]: With dead ends: 402 [2019-11-15 22:09:49,273 INFO L226 Difference]: Without dead ends: 312 [2019-11-15 22:09:49,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-15 22:09:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2019-11-15 22:09:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-15 22:09:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2019-11-15 22:09:49,280 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2019-11-15 22:09:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:49,281 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2019-11-15 22:09:49,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:09:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2019-11-15 22:09:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 22:09:49,283 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:49,283 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:49,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:49,487 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2019-11-15 22:09:49,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:49,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508003591] [2019-11-15 22:09:49,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:49,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:49,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:49,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508003591] [2019-11-15 22:09:49,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123464218] [2019-11-15 22:09:49,869 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:50,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:50,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:50,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 22:09:50,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:50,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:50,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-11-15 22:09:50,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763124796] [2019-11-15 22:09:50,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:09:50,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:50,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:09:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:09:50,094 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 13 states. [2019-11-15 22:09:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:50,481 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2019-11-15 22:09:50,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:09:50,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-11-15 22:09:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:50,483 INFO L225 Difference]: With dead ends: 311 [2019-11-15 22:09:50,483 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 22:09:50,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:09:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 22:09:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-11-15 22:09:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-15 22:09:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2019-11-15 22:09:50,492 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2019-11-15 22:09:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:50,492 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2019-11-15 22:09:50,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:09:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2019-11-15 22:09:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-15 22:09:50,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:50,494 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:50,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:50,701 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2019-11-15 22:09:50,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:50,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101636970] [2019-11-15 22:09:50,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:50,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:50,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:09:50,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101636970] [2019-11-15 22:09:50,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535265064] [2019-11-15 22:09:50,924 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:51,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:51,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:51,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:09:51,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:09:51,131 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:51,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 22:09:51,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214977755] [2019-11-15 22:09:51,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:09:51,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:09:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:51,132 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2019-11-15 22:09:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:51,325 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2019-11-15 22:09:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:09:51,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-11-15 22:09:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:51,328 INFO L225 Difference]: With dead ends: 442 [2019-11-15 22:09:51,328 INFO L226 Difference]: Without dead ends: 350 [2019-11-15 22:09:51,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:09:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-15 22:09:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-11-15 22:09:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-15 22:09:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2019-11-15 22:09:51,336 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2019-11-15 22:09:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:51,337 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2019-11-15 22:09:51,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:09:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2019-11-15 22:09:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 22:09:51,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:51,339 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:51,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:51,543 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2019-11-15 22:09:51,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:51,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738414361] [2019-11-15 22:09:51,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:51,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:51,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:51,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738414361] [2019-11-15 22:09:51,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507962757] [2019-11-15 22:09:51,993 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:52,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:09:52,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:52,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-15 22:09:52,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:52,534 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:52,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-15 22:09:52,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513735649] [2019-11-15 22:09:52,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:09:52,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:09:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:09:52,536 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 25 states. [2019-11-15 22:09:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:53,050 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2019-11-15 22:09:53,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:09:53,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2019-11-15 22:09:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:53,053 INFO L225 Difference]: With dead ends: 349 [2019-11-15 22:09:53,053 INFO L226 Difference]: Without dead ends: 347 [2019-11-15 22:09:53,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:09:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-15 22:09:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-11-15 22:09:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-15 22:09:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2019-11-15 22:09:53,075 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2019-11-15 22:09:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:53,076 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2019-11-15 22:09:53,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:09:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2019-11-15 22:09:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 22:09:53,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:53,078 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:53,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:53,282 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2019-11-15 22:09:53,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:53,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158515582] [2019-11-15 22:09:53,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:53,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:53,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:53,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158515582] [2019-11-15 22:09:53,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558313198] [2019-11-15 22:09:53,941 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:54,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:09:54,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:54,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:09:54,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:54,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:09:54,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:54,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:54,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 22:09:54,494 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:54,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2019-11-15 22:09:54,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174324346] [2019-11-15 22:09:54,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:09:54,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:09:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:09:54,497 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 22 states. [2019-11-15 22:09:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:55,597 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2019-11-15 22:09:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:09:55,598 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 155 [2019-11-15 22:09:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:55,600 INFO L225 Difference]: With dead ends: 545 [2019-11-15 22:09:55,600 INFO L226 Difference]: Without dead ends: 449 [2019-11-15 22:09:55,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:09:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-15 22:09:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2019-11-15 22:09:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-15 22:09:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2019-11-15 22:09:55,610 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2019-11-15 22:09:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:55,611 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2019-11-15 22:09:55,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:09:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2019-11-15 22:09:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 22:09:55,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:55,613 INFO L380 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:55,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:55,817 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2019-11-15 22:09:55,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:55,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13143038] [2019-11-15 22:09:55,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:55,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:55,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:09:55,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13143038] [2019-11-15 22:09:55,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177331475] [2019-11-15 22:09:55,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:56,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:09:56,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:09:56,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:56,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-15 22:09:56,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485567519] [2019-11-15 22:09:56,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:09:56,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:09:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:09:56,197 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 10 states. [2019-11-15 22:09:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:56,352 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2019-11-15 22:09:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:09:56,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2019-11-15 22:09:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:56,356 INFO L225 Difference]: With dead ends: 927 [2019-11-15 22:09:56,356 INFO L226 Difference]: Without dead ends: 760 [2019-11-15 22:09:56,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:09:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-15 22:09:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2019-11-15 22:09:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-15 22:09:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2019-11-15 22:09:56,376 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2019-11-15 22:09:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:56,377 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2019-11-15 22:09:56,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:09:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2019-11-15 22:09:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 22:09:56,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:56,379 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:56,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:56,583 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2019-11-15 22:09:56,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:56,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90231819] [2019-11-15 22:09:56,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:56,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:56,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:09:56,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90231819] [2019-11-15 22:09:56,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:09:56,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:09:56,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038372964] [2019-11-15 22:09:56,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:09:56,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:56,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:09:56,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:09:56,780 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 10 states. [2019-11-15 22:09:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:56,886 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2019-11-15 22:09:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:09:56,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2019-11-15 22:09:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:56,892 INFO L225 Difference]: With dead ends: 860 [2019-11-15 22:09:56,892 INFO L226 Difference]: Without dead ends: 856 [2019-11-15 22:09:56,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:09:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-11-15 22:09:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2019-11-15 22:09:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-11-15 22:09:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2019-11-15 22:09:56,910 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2019-11-15 22:09:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:56,911 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2019-11-15 22:09:56,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:09:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2019-11-15 22:09:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 22:09:56,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:56,913 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:56,913 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:56,914 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2019-11-15 22:09:56,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:56,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268720409] [2019-11-15 22:09:56,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:56,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:56,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:09:57,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268720409] [2019-11-15 22:09:57,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922366390] [2019-11-15 22:09:57,440 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:57,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-11-15 22:09:57,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:09:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:09:57,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:57,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:09:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:57,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:09:57,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:09:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:09:58,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:58,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-11-15 22:09:58,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88989861] [2019-11-15 22:09:58,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:09:58,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:58,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:09:58,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:09:58,069 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 27 states. [2019-11-15 22:09:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:58,832 INFO L93 Difference]: Finished difference Result 863 states and 1209 transitions. [2019-11-15 22:09:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:09:58,833 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 178 [2019-11-15 22:09:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:58,836 INFO L225 Difference]: With dead ends: 863 [2019-11-15 22:09:58,837 INFO L226 Difference]: Without dead ends: 861 [2019-11-15 22:09:58,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:09:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-15 22:09:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2019-11-15 22:09:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-11-15 22:09:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2019-11-15 22:09:58,857 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2019-11-15 22:09:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:58,858 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2019-11-15 22:09:58,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:09:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2019-11-15 22:09:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:09:58,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:58,860 INFO L380 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:59,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:59,065 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2019-11-15 22:09:59,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:59,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333036066] [2019-11-15 22:09:59,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:59,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:59,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:09:59,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333036066] [2019-11-15 22:09:59,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202621321] [2019-11-15 22:09:59,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:09:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:09:59,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:09:59,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:09:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 22:09:59,534 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:09:59,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-15 22:09:59,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788470854] [2019-11-15 22:09:59,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:09:59,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:09:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:09:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:09:59,536 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 11 states. [2019-11-15 22:09:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:09:59,708 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2019-11-15 22:09:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:09:59,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-11-15 22:09:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:09:59,714 INFO L225 Difference]: With dead ends: 1435 [2019-11-15 22:09:59,714 INFO L226 Difference]: Without dead ends: 959 [2019-11-15 22:09:59,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:09:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-11-15 22:09:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2019-11-15 22:09:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-15 22:09:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2019-11-15 22:09:59,740 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2019-11-15 22:09:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:09:59,741 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2019-11-15 22:09:59,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:09:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2019-11-15 22:09:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-15 22:09:59,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:09:59,744 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:09:59,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:09:59,949 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:09:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:09:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2019-11-15 22:09:59,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:09:59,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582715313] [2019-11-15 22:09:59,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:59,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:09:59,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:09:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:00,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582715313] [2019-11-15 22:10:00,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116672036] [2019-11-15 22:10:00,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:00,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-11-15 22:10:00,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:00,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 22:10:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 742 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:10:01,100 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:01,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2019-11-15 22:10:01,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121133825] [2019-11-15 22:10:01,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:10:01,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:10:01,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:10:01,102 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 29 states. [2019-11-15 22:10:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:01,761 INFO L93 Difference]: Finished difference Result 932 states and 1312 transitions. [2019-11-15 22:10:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:10:01,764 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 194 [2019-11-15 22:10:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:01,768 INFO L225 Difference]: With dead ends: 932 [2019-11-15 22:10:01,769 INFO L226 Difference]: Without dead ends: 930 [2019-11-15 22:10:01,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:10:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-11-15 22:10:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2019-11-15 22:10:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-15 22:10:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1310 transitions. [2019-11-15 22:10:01,788 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1310 transitions. Word has length 194 [2019-11-15 22:10:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:01,789 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1310 transitions. [2019-11-15 22:10:01,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:10:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1310 transitions. [2019-11-15 22:10:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 22:10:01,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:01,791 INFO L380 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:01,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:01,995 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2019-11-15 22:10:01,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:01,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839922365] [2019-11-15 22:10:01,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:01,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:01,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:10:02,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839922365] [2019-11-15 22:10:02,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163383780] [2019-11-15 22:10:02,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:02,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:10:02,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:02,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:10:02,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:10:02,535 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:02,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-15 22:10:02,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849492354] [2019-11-15 22:10:02,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:10:02,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:02,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:10:02,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:10:02,537 INFO L87 Difference]: Start difference. First operand 930 states and 1310 transitions. Second operand 12 states. [2019-11-15 22:10:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:02,721 INFO L93 Difference]: Finished difference Result 1125 states and 1565 transitions. [2019-11-15 22:10:02,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:10:02,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2019-11-15 22:10:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:02,727 INFO L225 Difference]: With dead ends: 1125 [2019-11-15 22:10:02,727 INFO L226 Difference]: Without dead ends: 1040 [2019-11-15 22:10:02,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:10:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-15 22:10:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2019-11-15 22:10:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2019-11-15 22:10:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1417 transitions. [2019-11-15 22:10:02,753 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1417 transitions. Word has length 211 [2019-11-15 22:10:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:02,753 INFO L462 AbstractCegarLoop]: Abstraction has 1008 states and 1417 transitions. [2019-11-15 22:10:02,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:10:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1417 transitions. [2019-11-15 22:10:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 22:10:02,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:02,756 INFO L380 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:02,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:02,960 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:02,961 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2019-11-15 22:10:02,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:02,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843874579] [2019-11-15 22:10:02,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:02,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:02,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 22:10:03,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843874579] [2019-11-15 22:10:03,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356083094] [2019-11-15 22:10:03,214 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:03,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:10:03,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:03,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 22:10:03,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 22:10:03,527 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:03,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-11-15 22:10:03,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272072824] [2019-11-15 22:10:03,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:10:03,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:10:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:10:03,530 INFO L87 Difference]: Start difference. First operand 1008 states and 1417 transitions. Second operand 13 states. [2019-11-15 22:10:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:03,751 INFO L93 Difference]: Finished difference Result 1675 states and 2348 transitions. [2019-11-15 22:10:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:10:03,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2019-11-15 22:10:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:03,757 INFO L225 Difference]: With dead ends: 1675 [2019-11-15 22:10:03,757 INFO L226 Difference]: Without dead ends: 1121 [2019-11-15 22:10:03,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:10:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-11-15 22:10:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2019-11-15 22:10:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-11-15 22:10:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1529 transitions. [2019-11-15 22:10:03,791 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1529 transitions. Word has length 239 [2019-11-15 22:10:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:03,791 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1529 transitions. [2019-11-15 22:10:03,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:10:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1529 transitions. [2019-11-15 22:10:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 22:10:03,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:03,793 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:03,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:03,998 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash -453919502, now seen corresponding path program 4 times [2019-11-15 22:10:03,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:03,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292197836] [2019-11-15 22:10:03,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:03,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:03,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 60 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:04,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292197836] [2019-11-15 22:10:04,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823781119] [2019-11-15 22:10:04,668 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:04,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:10:04,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:04,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-15 22:10:04,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 60 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:05,863 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:05,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2019-11-15 22:10:05,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981188232] [2019-11-15 22:10:05,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:10:05,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:05,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:10:05,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:10:05,868 INFO L87 Difference]: Start difference. First operand 1086 states and 1529 transitions. Second operand 41 states. [2019-11-15 22:10:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:06,802 INFO L93 Difference]: Finished difference Result 1088 states and 1530 transitions. [2019-11-15 22:10:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:10:06,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 240 [2019-11-15 22:10:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:06,809 INFO L225 Difference]: With dead ends: 1088 [2019-11-15 22:10:06,809 INFO L226 Difference]: Without dead ends: 1086 [2019-11-15 22:10:06,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:10:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-11-15 22:10:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2019-11-15 22:10:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-11-15 22:10:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1528 transitions. [2019-11-15 22:10:06,832 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1528 transitions. Word has length 240 [2019-11-15 22:10:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1528 transitions. [2019-11-15 22:10:06,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:10:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1528 transitions. [2019-11-15 22:10:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-15 22:10:06,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:06,835 INFO L380 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:07,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:07,038 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2019-11-15 22:10:07,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:07,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632389867] [2019-11-15 22:10:07,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:07,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:07,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 22:10:07,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632389867] [2019-11-15 22:10:07,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964547017] [2019-11-15 22:10:07,345 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:07,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-15 22:10:07,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:07,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:10:07,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 22:10:07,809 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:07,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-11-15 22:10:07,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631612461] [2019-11-15 22:10:07,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:10:07,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:10:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:10:07,811 INFO L87 Difference]: Start difference. First operand 1086 states and 1528 transitions. Second operand 14 states. [2019-11-15 22:10:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:07,978 INFO L93 Difference]: Finished difference Result 1287 states and 1787 transitions. [2019-11-15 22:10:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:10:07,978 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2019-11-15 22:10:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:07,982 INFO L225 Difference]: With dead ends: 1287 [2019-11-15 22:10:07,982 INFO L226 Difference]: Without dead ends: 1202 [2019-11-15 22:10:07,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:10:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-11-15 22:10:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2019-11-15 22:10:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2019-11-15 22:10:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1635 transitions. [2019-11-15 22:10:08,009 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1635 transitions. Word has length 257 [2019-11-15 22:10:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:08,009 INFO L462 AbstractCegarLoop]: Abstraction has 1164 states and 1635 transitions. [2019-11-15 22:10:08,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:10:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1635 transitions. [2019-11-15 22:10:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-15 22:10:08,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:08,012 INFO L380 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:08,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:08,217 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2019-11-15 22:10:08,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:08,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257737888] [2019-11-15 22:10:08,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:08,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:08,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:10:08,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257737888] [2019-11-15 22:10:08,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180249653] [2019-11-15 22:10:08,532 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:08,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 22:10:08,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:08,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:10:08,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:08,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2019-11-15 22:10:08,835 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:08,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-11-15 22:10:08,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238192215] [2019-11-15 22:10:08,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 22:10:08,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 22:10:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:10:08,837 INFO L87 Difference]: Start difference. First operand 1164 states and 1635 transitions. Second operand 19 states. [2019-11-15 22:10:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:09,603 INFO L93 Difference]: Finished difference Result 1318 states and 1838 transitions. [2019-11-15 22:10:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:10:09,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2019-11-15 22:10:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:09,606 INFO L225 Difference]: With dead ends: 1318 [2019-11-15 22:10:09,606 INFO L226 Difference]: Without dead ends: 686 [2019-11-15 22:10:09,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 22:10:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-15 22:10:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 659. [2019-11-15 22:10:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 22:10:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 909 transitions. [2019-11-15 22:10:09,622 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 909 transitions. Word has length 285 [2019-11-15 22:10:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:09,622 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 909 transitions. [2019-11-15 22:10:09,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 22:10:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 909 transitions. [2019-11-15 22:10:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-15 22:10:09,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:09,625 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:09,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:09,828 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1733592989, now seen corresponding path program 5 times [2019-11-15 22:10:09,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:09,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417017710] [2019-11-15 22:10:09,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:09,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:09,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 72 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:10,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417017710] [2019-11-15 22:10:10,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198097411] [2019-11-15 22:10:10,711 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:11,160 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-11-15 22:10:11,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:11,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 22:10:11,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 72 proven. 1796 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:10:11,480 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:11,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 30 [2019-11-15 22:10:11,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252243797] [2019-11-15 22:10:11,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:10:11,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:11,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:10:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:10:11,482 INFO L87 Difference]: Start difference. First operand 659 states and 909 transitions. Second operand 30 states. [2019-11-15 22:10:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:12,386 INFO L93 Difference]: Finished difference Result 661 states and 910 transitions. [2019-11-15 22:10:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:10:12,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 286 [2019-11-15 22:10:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:12,389 INFO L225 Difference]: With dead ends: 661 [2019-11-15 22:10:12,389 INFO L226 Difference]: Without dead ends: 659 [2019-11-15 22:10:12,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=862, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:10:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-15 22:10:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-15 22:10:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 22:10:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 908 transitions. [2019-11-15 22:10:12,401 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 908 transitions. Word has length 286 [2019-11-15 22:10:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:12,401 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 908 transitions. [2019-11-15 22:10:12,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:10:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 908 transitions. [2019-11-15 22:10:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 22:10:12,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:12,404 INFO L380 BasicCegarLoop]: trace histogram [29, 29, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:12,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:12,610 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:12,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:12,610 INFO L82 PathProgramCache]: Analyzing trace with hash -981412332, now seen corresponding path program 6 times [2019-11-15 22:10:12,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:12,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303064066] [2019-11-15 22:10:12,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:12,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:12,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 84 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:13,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303064066] [2019-11-15 22:10:13,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025806405] [2019-11-15 22:10:13,690 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:14,070 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-11-15 22:10:14,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:14,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-15 22:10:14,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:14,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 84 proven. 2425 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 22:10:14,727 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:14,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19] total 47 [2019-11-15 22:10:14,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726149510] [2019-11-15 22:10:14,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 22:10:14,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 22:10:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2042, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 22:10:14,729 INFO L87 Difference]: Start difference. First operand 659 states and 908 transitions. Second operand 47 states. [2019-11-15 22:10:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:15,878 INFO L93 Difference]: Finished difference Result 722 states and 993 transitions. [2019-11-15 22:10:15,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:10:15,879 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 332 [2019-11-15 22:10:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:15,881 INFO L225 Difference]: With dead ends: 722 [2019-11-15 22:10:15,882 INFO L226 Difference]: Without dead ends: 720 [2019-11-15 22:10:15,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=2131, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:10:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-15 22:10:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2019-11-15 22:10:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 22:10:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 991 transitions. [2019-11-15 22:10:15,896 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 991 transitions. Word has length 332 [2019-11-15 22:10:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:15,897 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 991 transitions. [2019-11-15 22:10:15,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 22:10:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 991 transitions. [2019-11-15 22:10:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-15 22:10:15,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:15,900 INFO L380 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:16,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:16,106 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2019-11-15 22:10:16,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:16,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654525723] [2019-11-15 22:10:16,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:16,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:16,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 22:10:16,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654525723] [2019-11-15 22:10:16,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668802852] [2019-11-15 22:10:16,538 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:16,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:10:16,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:16,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 2040 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:10:16,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 22:10:16,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:16,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-11-15 22:10:16,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789783594] [2019-11-15 22:10:16,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:10:16,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:16,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:10:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:10:16,945 INFO L87 Difference]: Start difference. First operand 720 states and 991 transitions. Second operand 18 states. [2019-11-15 22:10:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:17,092 INFO L93 Difference]: Finished difference Result 867 states and 1194 transitions. [2019-11-15 22:10:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:10:17,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2019-11-15 22:10:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:17,096 INFO L225 Difference]: With dead ends: 867 [2019-11-15 22:10:17,096 INFO L226 Difference]: Without dead ends: 782 [2019-11-15 22:10:17,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:10:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-15 22:10:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 737. [2019-11-15 22:10:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-15 22:10:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1015 transitions. [2019-11-15 22:10:17,109 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1015 transitions. Word has length 349 [2019-11-15 22:10:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:17,109 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1015 transitions. [2019-11-15 22:10:17,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:10:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1015 transitions. [2019-11-15 22:10:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-15 22:10:17,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:17,113 INFO L380 BasicCegarLoop]: trace histogram [33, 33, 32, 24, 24, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:17,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:17,319 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1592780293, now seen corresponding path program 7 times [2019-11-15 22:10:17,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:17,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046687220] [2019-11-15 22:10:17,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:17,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:17,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3368 backedges. 96 proven. 3272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:18,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046687220] [2019-11-15 22:10:18,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619806504] [2019-11-15 22:10:18,791 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/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-15 22:10:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:19,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 2187 conjuncts, 131 conjunts are in the unsatisfiable core [2019-11-15 22:10:19,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3368 backedges. 96 proven. 3272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:21,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:21,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 65 [2019-11-15 22:10:21,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006926185] [2019-11-15 22:10:21,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 22:10:21,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 22:10:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=4002, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 22:10:21,098 INFO L87 Difference]: Start difference. First operand 737 states and 1015 transitions. Second operand 65 states. [2019-11-15 22:10:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:22,878 INFO L93 Difference]: Finished difference Result 800 states and 1100 transitions. [2019-11-15 22:10:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 22:10:22,878 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 378 [2019-11-15 22:10:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:22,881 INFO L225 Difference]: With dead ends: 800 [2019-11-15 22:10:22,882 INFO L226 Difference]: Without dead ends: 798 [2019-11-15 22:10:22,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=158, Invalid=4002, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 22:10:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-11-15 22:10:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2019-11-15 22:10:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-11-15 22:10:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1098 transitions. [2019-11-15 22:10:22,896 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1098 transitions. Word has length 378 [2019-11-15 22:10:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:22,897 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 1098 transitions. [2019-11-15 22:10:22,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 22:10:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1098 transitions. [2019-11-15 22:10:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-11-15 22:10:22,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:22,900 INFO L380 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:23,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:23,105 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:10:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:23,105 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2019-11-15 22:10:23,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:23,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084192679] [2019-11-15 22:10:23,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:23,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:23,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:10:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:10:24,532 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:10:24,532 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:10:24,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:10:24 BoogieIcfgContainer [2019-11-15 22:10:24,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:10:24,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:10:24,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:10:24,727 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:10:24,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:09:33" (3/4) ... [2019-11-15 22:10:24,730 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:10:24,984 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_031995c2-6cfb-40ba-b487-16845a461aa4/bin/uautomizer/witness.graphml [2019-11-15 22:10:24,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:10:24,986 INFO L168 Benchmark]: Toolchain (without parser) took 53112.10 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 951.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:10:24,986 INFO L168 Benchmark]: CDTParser took 0.24 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-15 22:10:24,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:10:24,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.65 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:10:24,987 INFO L168 Benchmark]: Boogie Preprocessor took 78.74 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-15 22:10:24,987 INFO L168 Benchmark]: RCFGBuilder took 911.34 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: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:10:24,988 INFO L168 Benchmark]: TraceAbstraction took 51246.44 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 956.3 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -996.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:10:24,988 INFO L168 Benchmark]: Witness Printer took 257.50 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:10:24,990 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.24 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 512.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.65 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.74 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. * RCFGBuilder took 911.34 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: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51246.44 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 956.3 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -996.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 257.50 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_Protocol = 1; [L6] int m_msg_2 = 2; [L7] int m_recv_ack_2 = 3; [L8] int m_msg_1_1 = 4; [L9] int m_msg_1_2 = 5; [L10] int m_recv_ack_1_1 = 6; [L11] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L16] int q = 0; [L17] int method_id; [L20] int this_expect = 0; [L21] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [L48] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L50] COND FALSE !(0) [L54] q = 1 [L56] this_expect=0 [L56] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND TRUE this_expect > 16 [L39] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L569] __VERIFIER_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. Result: UNSAFE, OverallTime: 51.1s, OverallIterations: 44, TraceHistogramMax: 35, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11153 SDtfs, 14642 SDslu, 142902 SDs, 0 SdLazy, 17662 SolverSat, 601 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5606 GetRequests, 5009 SyntacticMatches, 43 SemanticMatches, 554 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred 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: 0.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 366 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 10856 NumberOfCodeBlocks, 10426 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 10385 ConstructedInterpolants, 0 QuantifiedInterpolants, 13596320 SizeOfPredicates, 83 NumberOfNonLiveVariables, 26760 ConjunctsInSsa, 1041 ConjunctsInUnsatCore, 76 InterpolantComputations, 10 PerfectInterpolantSequences, 8280/49367 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...