./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.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_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 f2969d4725852fd68e7759cdb7f1d1929ca0124c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:36:54,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:36:54,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:36:54,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:36:54,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:36:54,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:36:54,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:36:54,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:36:54,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:36:54,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:36:54,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:36:54,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:36:54,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:36:54,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:36:54,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:36:54,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:36:54,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:36:54,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:36:54,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:36:54,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:36:54,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:36:54,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:36:54,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:36:54,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:36:54,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:36:54,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:36:54,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:36:54,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:36:54,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:36:54,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:36:54,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:36:54,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:36:54,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:36:54,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:36:54,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:36:54,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:36:54,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:36:54,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:36:54,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:36:54,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:36:54,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:36:54,071 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:36:54,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:36:54,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:36:54,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:36:54,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:36:54,085 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:36:54,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:36:54,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:36:54,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:36:54,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:36:54,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:36:54,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:36:54,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:36:54,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:36:54,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:36:54,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:36:54,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:36:54,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:36:54,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:36:54,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:36:54,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:36:54,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:36:54,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:36:54,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:36:54,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:36:54,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:36:54,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:36:54,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:36:54,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:36:54,090 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_9e81440e-8e94-4075-ac34-415dc3b7101f/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 -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2019-11-15 23:36:54,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:36:54,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:36:54,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:36:54,131 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:36:54,131 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:36:54,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-11-15 23:36:54,184 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/data/a19bd26bf/e960cb5a791a46b691427f4aacbc7e60/FLAG482bfd7c5 [2019-11-15 23:36:54,580 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:36:54,581 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-11-15 23:36:54,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/data/a19bd26bf/e960cb5a791a46b691427f4aacbc7e60/FLAG482bfd7c5 [2019-11-15 23:36:54,908 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/data/a19bd26bf/e960cb5a791a46b691427f4aacbc7e60 [2019-11-15 23:36:54,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:36:54,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:36:54,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:54,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:36:54,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:36:54,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f4a186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54, skipping insertion in model container [2019-11-15 23:36:54,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:36:54,954 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:36:55,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:55,327 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:36:55,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:55,381 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:36:55,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55 WrapperNode [2019-11-15 23:36:55,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:55,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:55,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:36:55,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:36:55,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:55,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:36:55,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:36:55,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:36:55,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... [2019-11-15 23:36:55,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:36:55,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:36:55,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:36:55,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:36:55,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:36:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:36:55,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:36:56,005 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:36:56,005 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-15 23:36:56,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:56 BoogieIcfgContainer [2019-11-15 23:36:56,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:36:56,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:36:56,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:36:56,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:36:56,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:36:54" (1/3) ... [2019-11-15 23:36:56,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67500090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:56, skipping insertion in model container [2019-11-15 23:36:56,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:55" (2/3) ... [2019-11-15 23:36:56,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67500090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:56, skipping insertion in model container [2019-11-15 23:36:56,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:56" (3/3) ... [2019-11-15 23:36:56,014 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-11-15 23:36:56,023 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:36:56,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:36:56,041 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:36:56,063 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:36:56,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:36:56,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:36:56,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:36:56,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:36:56,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:36:56,064 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:36:56,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:36:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-15 23:36:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:36:56,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:56,089 INFO L380 BasicCegarLoop]: trace histogram [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 23:36:56,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1524648029, now seen corresponding path program 1 times [2019-11-15 23:36:56,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:56,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162591897] [2019-11-15 23:36:56,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:56,283 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 23:36:56,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162591897] [2019-11-15 23:36:56,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:56,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:36:56,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224431272] [2019-11-15 23:36:56,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:36:56,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:56,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:36:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:36:56,303 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2019-11-15 23:36:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:56,408 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2019-11-15 23:36:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:36:56,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-15 23:36:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:56,424 INFO L225 Difference]: With dead ends: 129 [2019-11-15 23:36:56,425 INFO L226 Difference]: Without dead ends: 70 [2019-11-15 23:36:56,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-15 23:36:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-15 23:36:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 23:36:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-11-15 23:36:56,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 23 [2019-11-15 23:36:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:56,488 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-11-15 23:36:56,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:36:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-11-15 23:36:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:36:56,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:56,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:56,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1049597017, now seen corresponding path program 1 times [2019-11-15 23:36:56,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:56,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773534540] [2019-11-15 23:36:56,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:56,659 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 23:36:56,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773534540] [2019-11-15 23:36:56,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:56,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:56,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092173022] [2019-11-15 23:36:56,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:56,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:56,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:56,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:56,663 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 3 states. [2019-11-15 23:36:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:56,688 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2019-11-15 23:36:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:56,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:36:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:56,691 INFO L225 Difference]: With dead ends: 156 [2019-11-15 23:36:56,691 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 23:36:56,692 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 23:36:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 23:36:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-15 23:36:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:36:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2019-11-15 23:36:56,704 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 39 [2019-11-15 23:36:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:56,705 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2019-11-15 23:36:56,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2019-11-15 23:36:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:36:56,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:56,707 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:56,707 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2018870194, now seen corresponding path program 1 times [2019-11-15 23:36:56,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:56,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610185534] [2019-11-15 23:36:56,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:56,838 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 23:36:56,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610185534] [2019-11-15 23:36:56,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:56,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:56,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023589904] [2019-11-15 23:36:56,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:56,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:56,844 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand 3 states. [2019-11-15 23:36:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:56,885 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2019-11-15 23:36:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:56,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-15 23:36:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:56,888 INFO L225 Difference]: With dead ends: 249 [2019-11-15 23:36:56,889 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 23:36:56,890 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 23:36:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 23:36:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-11-15 23:36:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 23:36:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-15 23:36:56,908 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 40 [2019-11-15 23:36:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:56,909 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-15 23:36:56,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-15 23:36:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:36:56,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:56,911 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:56,911 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1411558281, now seen corresponding path program 1 times [2019-11-15 23:36:56,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:56,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011895297] [2019-11-15 23:36:56,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:56,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:57,007 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 23:36:57,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011895297] [2019-11-15 23:36:57,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:57,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:57,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580882290] [2019-11-15 23:36:57,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:57,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:57,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:57,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:57,011 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 5 states. [2019-11-15 23:36:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:57,155 INFO L93 Difference]: Finished difference Result 731 states and 1126 transitions. [2019-11-15 23:36:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:36:57,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-15 23:36:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:57,163 INFO L225 Difference]: With dead ends: 731 [2019-11-15 23:36:57,163 INFO L226 Difference]: Without dead ends: 589 [2019-11-15 23:36:57,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-15 23:36:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 303. [2019-11-15 23:36:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-11-15 23:36:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 454 transitions. [2019-11-15 23:36:57,203 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 454 transitions. Word has length 41 [2019-11-15 23:36:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:57,203 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 454 transitions. [2019-11-15 23:36:57,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 454 transitions. [2019-11-15 23:36:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:36:57,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:57,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:57,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash 425310312, now seen corresponding path program 1 times [2019-11-15 23:36:57,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:57,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145540601] [2019-11-15 23:36:57,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:57,344 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 23:36:57,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145540601] [2019-11-15 23:36:57,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:57,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:57,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294688539] [2019-11-15 23:36:57,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:57,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:57,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:57,346 INFO L87 Difference]: Start difference. First operand 303 states and 454 transitions. Second operand 5 states. [2019-11-15 23:36:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:57,436 INFO L93 Difference]: Finished difference Result 1077 states and 1629 transitions. [2019-11-15 23:36:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:36:57,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-15 23:36:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:57,446 INFO L225 Difference]: With dead ends: 1077 [2019-11-15 23:36:57,446 INFO L226 Difference]: Without dead ends: 795 [2019-11-15 23:36:57,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-11-15 23:36:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2019-11-15 23:36:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-11-15 23:36:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1186 transitions. [2019-11-15 23:36:57,496 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1186 transitions. Word has length 42 [2019-11-15 23:36:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:57,497 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1186 transitions. [2019-11-15 23:36:57,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:36:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1186 transitions. [2019-11-15 23:36:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:36:57,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:57,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:57,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1864742082, now seen corresponding path program 1 times [2019-11-15 23:36:57,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:57,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987824723] [2019-11-15 23:36:57,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:57,597 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 23:36:57,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987824723] [2019-11-15 23:36:57,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:57,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:57,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149725403] [2019-11-15 23:36:57,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:57,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:57,600 INFO L87 Difference]: Start difference. First operand 791 states and 1186 transitions. Second operand 3 states. [2019-11-15 23:36:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:57,665 INFO L93 Difference]: Finished difference Result 2115 states and 3156 transitions. [2019-11-15 23:36:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:57,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-15 23:36:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:57,674 INFO L225 Difference]: With dead ends: 2115 [2019-11-15 23:36:57,675 INFO L226 Difference]: Without dead ends: 1345 [2019-11-15 23:36:57,676 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 23:36:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-11-15 23:36:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1343. [2019-11-15 23:36:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-15 23:36:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1966 transitions. [2019-11-15 23:36:57,748 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1966 transitions. Word has length 42 [2019-11-15 23:36:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:57,748 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1966 transitions. [2019-11-15 23:36:57,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1966 transitions. [2019-11-15 23:36:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:36:57,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:57,752 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:57,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1762112994, now seen corresponding path program 1 times [2019-11-15 23:36:57,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:57,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200872044] [2019-11-15 23:36:57,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:57,887 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 23:36:57,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200872044] [2019-11-15 23:36:57,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:57,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:36:57,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356788429] [2019-11-15 23:36:57,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:36:57,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:36:57,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:57,889 INFO L87 Difference]: Start difference. First operand 1343 states and 1966 transitions. Second operand 7 states. [2019-11-15 23:36:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:58,173 INFO L93 Difference]: Finished difference Result 2857 states and 4103 transitions. [2019-11-15 23:36:58,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:36:58,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-15 23:36:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:58,188 INFO L225 Difference]: With dead ends: 2857 [2019-11-15 23:36:58,188 INFO L226 Difference]: Without dead ends: 2855 [2019-11-15 23:36:58,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:36:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2019-11-15 23:36:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1487. [2019-11-15 23:36:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-11-15 23:36:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2110 transitions. [2019-11-15 23:36:58,281 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2110 transitions. Word has length 43 [2019-11-15 23:36:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:58,283 INFO L462 AbstractCegarLoop]: Abstraction has 1487 states and 2110 transitions. [2019-11-15 23:36:58,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:36:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2110 transitions. [2019-11-15 23:36:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:36:58,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:58,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:36:58,284 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1261650507, now seen corresponding path program 1 times [2019-11-15 23:36:58,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:58,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513753280] [2019-11-15 23:36:58,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:58,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:58,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:58,330 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 23:36:58,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513753280] [2019-11-15 23:36:58,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:58,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:36:58,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859676624] [2019-11-15 23:36:58,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:36:58,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:36:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:36:58,332 INFO L87 Difference]: Start difference. First operand 1487 states and 2110 transitions. Second operand 3 states. [2019-11-15 23:36:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:58,424 INFO L93 Difference]: Finished difference Result 3505 states and 4978 transitions. [2019-11-15 23:36:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:36:58,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 23:36:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:58,435 INFO L225 Difference]: With dead ends: 3505 [2019-11-15 23:36:58,435 INFO L226 Difference]: Without dead ends: 2039 [2019-11-15 23:36:58,438 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 23:36:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-11-15 23:36:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2019-11-15 23:36:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-11-15 23:36:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2868 transitions. [2019-11-15 23:36:58,542 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2868 transitions. Word has length 44 [2019-11-15 23:36:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:58,542 INFO L462 AbstractCegarLoop]: Abstraction has 2037 states and 2868 transitions. [2019-11-15 23:36:58,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:36:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2868 transitions. [2019-11-15 23:36:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:36:58,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:58,546 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:58,546 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:58,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932519, now seen corresponding path program 1 times [2019-11-15 23:36:58,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:58,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630020044] [2019-11-15 23:36:58,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:58,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:58,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:36:58,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630020044] [2019-11-15 23:36:58,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60215029] [2019-11-15 23:36:58,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:36:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:58,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:36:58,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:36:58,848 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:36:58,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2019-11-15 23:36:58,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322561104] [2019-11-15 23:36:58,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:36:58,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:36:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:36:58,851 INFO L87 Difference]: Start difference. First operand 2037 states and 2868 transitions. Second operand 7 states. [2019-11-15 23:36:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:59,051 INFO L93 Difference]: Finished difference Result 5052 states and 7158 transitions. [2019-11-15 23:36:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:36:59,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-15 23:36:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:59,071 INFO L225 Difference]: With dead ends: 5052 [2019-11-15 23:36:59,071 INFO L226 Difference]: Without dead ends: 3586 [2019-11-15 23:36:59,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:36:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2019-11-15 23:36:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3365. [2019-11-15 23:36:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3365 states. [2019-11-15 23:36:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4708 transitions. [2019-11-15 23:36:59,293 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4708 transitions. Word has length 63 [2019-11-15 23:36:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:59,295 INFO L462 AbstractCegarLoop]: Abstraction has 3365 states and 4708 transitions. [2019-11-15 23:36:59,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:36:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4708 transitions. [2019-11-15 23:36:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:36:59,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:59,297 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:59,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:36:59,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1752116912, now seen corresponding path program 1 times [2019-11-15 23:36:59,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:59,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318383849] [2019-11-15 23:36:59,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:59,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:59,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:59,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318383849] [2019-11-15 23:36:59,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182510554] [2019-11-15 23:36:59,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:36:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:59,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:36:59,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:59,774 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:36:59,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 23:36:59,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760675755] [2019-11-15 23:36:59,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:36:59,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:36:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:36:59,777 INFO L87 Difference]: Start difference. First operand 3365 states and 4708 transitions. Second operand 11 states. [2019-11-15 23:37:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:00,547 INFO L93 Difference]: Finished difference Result 11106 states and 15593 transitions. [2019-11-15 23:37:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:37:00,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-11-15 23:37:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:00,634 INFO L225 Difference]: With dead ends: 11106 [2019-11-15 23:37:00,635 INFO L226 Difference]: Without dead ends: 8752 [2019-11-15 23:37:00,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:37:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2019-11-15 23:37:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 4615. [2019-11-15 23:37:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2019-11-15 23:37:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6480 transitions. [2019-11-15 23:37:00,946 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6480 transitions. Word has length 64 [2019-11-15 23:37:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:00,946 INFO L462 AbstractCegarLoop]: Abstraction has 4615 states and 6480 transitions. [2019-11-15 23:37:00,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:37:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6480 transitions. [2019-11-15 23:37:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:37:00,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:00,949 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:01,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:01,161 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1324770848, now seen corresponding path program 1 times [2019-11-15 23:37:01,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:01,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827346262] [2019-11-15 23:37:01,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:01,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:01,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:01,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827346262] [2019-11-15 23:37:01,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:01,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:01,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636017787] [2019-11-15 23:37:01,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:01,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:01,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:01,204 INFO L87 Difference]: Start difference. First operand 4615 states and 6480 transitions. Second operand 3 states. [2019-11-15 23:37:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:01,468 INFO L93 Difference]: Finished difference Result 7507 states and 10507 transitions. [2019-11-15 23:37:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:01,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 23:37:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:01,492 INFO L225 Difference]: With dead ends: 7507 [2019-11-15 23:37:01,493 INFO L226 Difference]: Without dead ends: 4880 [2019-11-15 23:37:01,497 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 23:37:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2019-11-15 23:37:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4683. [2019-11-15 23:37:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4683 states. [2019-11-15 23:37:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 6431 transitions. [2019-11-15 23:37:01,813 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 6431 transitions. Word has length 64 [2019-11-15 23:37:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:01,813 INFO L462 AbstractCegarLoop]: Abstraction has 4683 states and 6431 transitions. [2019-11-15 23:37:01,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6431 transitions. [2019-11-15 23:37:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:37:01,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:01,816 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:37:01,816 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash -693070170, now seen corresponding path program 1 times [2019-11-15 23:37:01,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:01,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273852390] [2019-11-15 23:37:01,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:01,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:01,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:01,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273852390] [2019-11-15 23:37:01,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:01,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:01,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176661000] [2019-11-15 23:37:01,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:01,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:01,861 INFO L87 Difference]: Start difference. First operand 4683 states and 6431 transitions. Second operand 3 states. [2019-11-15 23:37:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:02,165 INFO L93 Difference]: Finished difference Result 9747 states and 13357 transitions. [2019-11-15 23:37:02,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:02,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 23:37:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:02,193 INFO L225 Difference]: With dead ends: 9747 [2019-11-15 23:37:02,193 INFO L226 Difference]: Without dead ends: 6169 [2019-11-15 23:37:02,199 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 23:37:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-11-15 23:37:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6129. [2019-11-15 23:37:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-11-15 23:37:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 8308 transitions. [2019-11-15 23:37:02,535 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 8308 transitions. Word has length 64 [2019-11-15 23:37:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:02,535 INFO L462 AbstractCegarLoop]: Abstraction has 6129 states and 8308 transitions. [2019-11-15 23:37:02,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 8308 transitions. [2019-11-15 23:37:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:37:02,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:02,543 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:02,543 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:02,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:02,543 INFO L82 PathProgramCache]: Analyzing trace with hash 809095304, now seen corresponding path program 1 times [2019-11-15 23:37:02,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:02,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922224491] [2019-11-15 23:37:02,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:02,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:02,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:02,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922224491] [2019-11-15 23:37:02,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480472267] [2019-11-15 23:37:02,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:37:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:02,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:37:02,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:02,895 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:02,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-15 23:37:02,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760585032] [2019-11-15 23:37:02,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:37:02,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:02,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:37:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:37:02,900 INFO L87 Difference]: Start difference. First operand 6129 states and 8308 transitions. Second operand 13 states. [2019-11-15 23:37:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:05,810 INFO L93 Difference]: Finished difference Result 32990 states and 44451 transitions. [2019-11-15 23:37:05,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 23:37:05,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-11-15 23:37:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:05,877 INFO L225 Difference]: With dead ends: 32990 [2019-11-15 23:37:05,878 INFO L226 Difference]: Without dead ends: 30416 [2019-11-15 23:37:05,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=585, Invalid=1577, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 23:37:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30416 states. [2019-11-15 23:37:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30416 to 7321. [2019-11-15 23:37:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-11-15 23:37:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 9951 transitions. [2019-11-15 23:37:06,556 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 9951 transitions. Word has length 64 [2019-11-15 23:37:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:06,557 INFO L462 AbstractCegarLoop]: Abstraction has 7321 states and 9951 transitions. [2019-11-15 23:37:06,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:37:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 9951 transitions. [2019-11-15 23:37:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:37:06,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:06,560 INFO L380 BasicCegarLoop]: trace histogram [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, 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 23:37:06,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:06,765 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:06,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1571663051, now seen corresponding path program 1 times [2019-11-15 23:37:06,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:06,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164362638] [2019-11-15 23:37:06,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:06,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:06,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:06,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164362638] [2019-11-15 23:37:06,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:06,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:06,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576815984] [2019-11-15 23:37:06,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:06,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:06,828 INFO L87 Difference]: Start difference. First operand 7321 states and 9951 transitions. Second operand 3 states. [2019-11-15 23:37:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:07,076 INFO L93 Difference]: Finished difference Result 9554 states and 12821 transitions. [2019-11-15 23:37:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:07,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 23:37:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:07,091 INFO L225 Difference]: With dead ends: 9554 [2019-11-15 23:37:07,091 INFO L226 Difference]: Without dead ends: 6443 [2019-11-15 23:37:07,096 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 23:37:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2019-11-15 23:37:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 6425. [2019-11-15 23:37:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6425 states. [2019-11-15 23:37:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 8512 transitions. [2019-11-15 23:37:07,543 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 8512 transitions. Word has length 65 [2019-11-15 23:37:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:07,543 INFO L462 AbstractCegarLoop]: Abstraction has 6425 states and 8512 transitions. [2019-11-15 23:37:07,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 8512 transitions. [2019-11-15 23:37:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:37:07,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:07,546 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:37:07,546 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1664257503, now seen corresponding path program 1 times [2019-11-15 23:37:07,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:07,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654952261] [2019-11-15 23:37:07,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:07,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:07,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:07,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654952261] [2019-11-15 23:37:07,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081047356] [2019-11-15 23:37:07,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:37:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:07,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:37:07,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:07,767 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:07,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 23:37:07,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730623468] [2019-11-15 23:37:07,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:37:07,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:37:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:37:07,770 INFO L87 Difference]: Start difference. First operand 6425 states and 8512 transitions. Second operand 11 states. [2019-11-15 23:37:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:08,436 INFO L93 Difference]: Finished difference Result 13260 states and 17440 transitions. [2019-11-15 23:37:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:37:08,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-15 23:37:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:08,449 INFO L225 Difference]: With dead ends: 13260 [2019-11-15 23:37:08,449 INFO L226 Difference]: Without dead ends: 10002 [2019-11-15 23:37:08,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:37:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2019-11-15 23:37:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 6733. [2019-11-15 23:37:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-11-15 23:37:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8842 transitions. [2019-11-15 23:37:09,085 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8842 transitions. Word has length 65 [2019-11-15 23:37:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:09,086 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 8842 transitions. [2019-11-15 23:37:09,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:37:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8842 transitions. [2019-11-15 23:37:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:37:09,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:09,091 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:37:09,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:09,304 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1283872475, now seen corresponding path program 1 times [2019-11-15 23:37:09,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:09,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468846566] [2019-11-15 23:37:09,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:09,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:09,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:09,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468846566] [2019-11-15 23:37:09,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:09,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:09,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804255723] [2019-11-15 23:37:09,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:09,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:09,338 INFO L87 Difference]: Start difference. First operand 6733 states and 8842 transitions. Second operand 3 states. [2019-11-15 23:37:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:09,697 INFO L93 Difference]: Finished difference Result 13969 states and 18394 transitions. [2019-11-15 23:37:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:09,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 23:37:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:09,707 INFO L225 Difference]: With dead ends: 13969 [2019-11-15 23:37:09,707 INFO L226 Difference]: Without dead ends: 8983 [2019-11-15 23:37:09,714 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 23:37:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2019-11-15 23:37:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8821. [2019-11-15 23:37:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2019-11-15 23:37:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 11392 transitions. [2019-11-15 23:37:10,215 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 11392 transitions. Word has length 65 [2019-11-15 23:37:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:10,215 INFO L462 AbstractCegarLoop]: Abstraction has 8821 states and 11392 transitions. [2019-11-15 23:37:10,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 11392 transitions. [2019-11-15 23:37:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:37:10,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:10,219 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:10,219 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1516803518, now seen corresponding path program 1 times [2019-11-15 23:37:10,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:10,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837944089] [2019-11-15 23:37:10,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:10,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:10,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:37:10,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837944089] [2019-11-15 23:37:10,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:10,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:10,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136359549] [2019-11-15 23:37:10,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:10,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:10,291 INFO L87 Difference]: Start difference. First operand 8821 states and 11392 transitions. Second operand 6 states. [2019-11-15 23:37:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:11,176 INFO L93 Difference]: Finished difference Result 20417 states and 26304 transitions. [2019-11-15 23:37:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:11,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 23:37:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:11,186 INFO L225 Difference]: With dead ends: 20417 [2019-11-15 23:37:11,186 INFO L226 Difference]: Without dead ends: 11653 [2019-11-15 23:37:11,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:37:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11653 states. [2019-11-15 23:37:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11653 to 11469. [2019-11-15 23:37:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11469 states. [2019-11-15 23:37:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 14643 transitions. [2019-11-15 23:37:11,751 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 14643 transitions. Word has length 65 [2019-11-15 23:37:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:11,752 INFO L462 AbstractCegarLoop]: Abstraction has 11469 states and 14643 transitions. [2019-11-15 23:37:11,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 14643 transitions. [2019-11-15 23:37:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:37:11,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:11,757 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:11,757 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 815203644, now seen corresponding path program 1 times [2019-11-15 23:37:11,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:11,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148351693] [2019-11-15 23:37:11,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:11,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:11,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:37:11,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148351693] [2019-11-15 23:37:11,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:11,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:11,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234255892] [2019-11-15 23:37:11,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:11,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:11,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:11,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:11,824 INFO L87 Difference]: Start difference. First operand 11469 states and 14643 transitions. Second operand 5 states. [2019-11-15 23:37:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:12,660 INFO L93 Difference]: Finished difference Result 17982 states and 23210 transitions. [2019-11-15 23:37:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:12,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:37:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:12,671 INFO L225 Difference]: With dead ends: 17982 [2019-11-15 23:37:12,671 INFO L226 Difference]: Without dead ends: 15048 [2019-11-15 23:37:12,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2019-11-15 23:37:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 12838. [2019-11-15 23:37:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12838 states. [2019-11-15 23:37:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12838 states to 12838 states and 16362 transitions. [2019-11-15 23:37:13,246 INFO L78 Accepts]: Start accepts. Automaton has 12838 states and 16362 transitions. Word has length 65 [2019-11-15 23:37:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:13,246 INFO L462 AbstractCegarLoop]: Abstraction has 12838 states and 16362 transitions. [2019-11-15 23:37:13,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 12838 states and 16362 transitions. [2019-11-15 23:37:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:37:13,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:13,250 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:37:13,250 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash 352986821, now seen corresponding path program 1 times [2019-11-15 23:37:13,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:13,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668640945] [2019-11-15 23:37:13,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:13,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:37:13,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668640945] [2019-11-15 23:37:13,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:13,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:13,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792612813] [2019-11-15 23:37:13,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:13,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:13,490 INFO L87 Difference]: Start difference. First operand 12838 states and 16362 transitions. Second operand 5 states. [2019-11-15 23:37:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:14,266 INFO L93 Difference]: Finished difference Result 19312 states and 24919 transitions. [2019-11-15 23:37:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:14,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:37:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:14,280 INFO L225 Difference]: With dead ends: 19312 [2019-11-15 23:37:14,280 INFO L226 Difference]: Without dead ends: 16403 [2019-11-15 23:37:14,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2019-11-15 23:37:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 15212. [2019-11-15 23:37:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15212 states. [2019-11-15 23:37:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15212 states to 15212 states and 19402 transitions. [2019-11-15 23:37:14,994 INFO L78 Accepts]: Start accepts. Automaton has 15212 states and 19402 transitions. Word has length 66 [2019-11-15 23:37:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:14,995 INFO L462 AbstractCegarLoop]: Abstraction has 15212 states and 19402 transitions. [2019-11-15 23:37:14,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15212 states and 19402 transitions. [2019-11-15 23:37:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:37:14,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:14,999 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:37:14,999 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1404868071, now seen corresponding path program 1 times [2019-11-15 23:37:14,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:14,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870852557] [2019-11-15 23:37:15,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:37:15,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870852557] [2019-11-15 23:37:15,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:15,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:15,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713552008] [2019-11-15 23:37:15,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:15,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:15,078 INFO L87 Difference]: Start difference. First operand 15212 states and 19402 transitions. Second operand 5 states. [2019-11-15 23:37:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:16,260 INFO L93 Difference]: Finished difference Result 21150 states and 27244 transitions. [2019-11-15 23:37:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:16,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:37:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:16,274 INFO L225 Difference]: With dead ends: 21150 [2019-11-15 23:37:16,274 INFO L226 Difference]: Without dead ends: 18424 [2019-11-15 23:37:16,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18424 states. [2019-11-15 23:37:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18424 to 17222. [2019-11-15 23:37:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17222 states. [2019-11-15 23:37:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17222 states to 17222 states and 21948 transitions. [2019-11-15 23:37:17,062 INFO L78 Accepts]: Start accepts. Automaton has 17222 states and 21948 transitions. Word has length 66 [2019-11-15 23:37:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:17,062 INFO L462 AbstractCegarLoop]: Abstraction has 17222 states and 21948 transitions. [2019-11-15 23:37:17,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17222 states and 21948 transitions. [2019-11-15 23:37:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:37:17,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:17,067 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:37:17,067 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1470846148, now seen corresponding path program 1 times [2019-11-15 23:37:17,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:17,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783810122] [2019-11-15 23:37:17,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:17,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:17,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783810122] [2019-11-15 23:37:17,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40433894] [2019-11-15 23:37:17,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:37:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:17,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:37:17,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:17,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:18,835 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:18,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2019-11-15 23:37:18,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977280122] [2019-11-15 23:37:18,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 23:37:18,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 23:37:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:37:18,837 INFO L87 Difference]: Start difference. First operand 17222 states and 21948 transitions. Second operand 20 states. [2019-11-15 23:37:19,326 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-15 23:37:19,529 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-15 23:37:19,844 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-11-15 23:37:20,118 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-11-15 23:37:20,424 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:37:20,880 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:37:21,294 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-15 23:37:21,633 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-15 23:37:21,953 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-15 23:37:22,313 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-15 23:37:22,599 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-15 23:37:22,876 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-11-15 23:37:23,267 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-15 23:37:23,554 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-15 23:37:23,890 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-11-15 23:37:24,159 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-15 23:37:24,427 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-15 23:37:24,735 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-15 23:37:24,992 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-15 23:37:25,235 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-15 23:37:25,563 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-15 23:37:25,786 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-15 23:37:26,020 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-15 23:37:26,303 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:37:26,583 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-15 23:37:26,921 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-15 23:37:27,279 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-15 23:37:27,532 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-15 23:37:27,878 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-15 23:37:28,115 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-15 23:37:28,406 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-15 23:37:29,034 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-15 23:37:29,349 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-15 23:37:29,630 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-15 23:37:30,462 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-15 23:37:30,794 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-15 23:37:31,141 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-11-15 23:37:31,447 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-15 23:37:31,850 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-15 23:37:32,126 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-11-15 23:37:32,435 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-15 23:37:32,751 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-15 23:37:33,094 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-11-15 23:37:33,390 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 23:37:33,578 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 23:37:33,920 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-11-15 23:37:34,199 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-11-15 23:37:34,465 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-15 23:37:34,832 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-15 23:37:35,278 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-15 23:37:35,548 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-15 23:37:35,789 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-15 23:37:36,066 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-15 23:37:36,374 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-15 23:37:36,613 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-15 23:37:36,809 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 23:37:37,177 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-11-15 23:37:37,478 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-15 23:37:37,698 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-15 23:37:37,859 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 23:37:38,018 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-15 23:37:38,523 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-11-15 23:37:38,779 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-15 23:37:39,104 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-11-15 23:37:39,401 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-15 23:37:39,777 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-15 23:37:39,990 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-15 23:37:40,161 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:37:40,342 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 23:37:40,623 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 23:37:40,859 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-15 23:37:41,005 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 23:37:41,156 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-15 23:37:41,629 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-15 23:37:41,800 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:37:41,966 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 23:37:42,313 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-15 23:37:42,471 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:37:42,847 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-15 23:37:43,033 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 23:37:43,218 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-15 23:37:43,697 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-15 23:37:43,986 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-15 23:37:44,331 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-15 23:37:44,526 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 23:37:44,712 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 23:37:44,919 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-15 23:37:45,163 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:37:45,821 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-15 23:37:46,214 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-15 23:37:46,419 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 23:37:46,706 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:37:46,985 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 23:37:47,231 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:37:47,541 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 23:37:47,714 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-15 23:37:48,105 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-15 23:37:48,490 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-15 23:37:48,684 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 23:37:48,848 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 23:37:49,313 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 23:37:49,646 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-11-15 23:37:49,858 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-15 23:37:50,430 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:37:50,728 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-15 23:37:51,131 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-15 23:37:51,482 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-15 23:37:51,668 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 23:37:51,867 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-15 23:37:52,198 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 23:37:52,381 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 23:37:52,860 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-15 23:37:53,047 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:37:53,278 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-15 23:37:55,198 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 23:37:57,040 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 23:37:57,471 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 23:37:58,402 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-15 23:37:58,711 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 23:37:59,255 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-15 23:37:59,642 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-11-15 23:38:00,034 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:38:00,458 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-11-15 23:38:00,875 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 23:38:01,063 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:38:01,631 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 23:38:02,018 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-15 23:38:02,429 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 23:38:02,627 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-15 23:38:03,185 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-15 23:38:03,438 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:38:03,601 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 23:38:07,053 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-15 23:38:07,225 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 23:38:07,660 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-15 23:38:07,883 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-15 23:38:08,238 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-15 23:38:08,569 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-15 23:38:08,795 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 23:38:09,145 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-15 23:38:09,311 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 23:38:09,509 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:38:09,742 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 23:38:10,023 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-15 23:38:10,388 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 23:38:10,631 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-15 23:38:10,907 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-15 23:38:11,130 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:38:11,368 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:38:11,778 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 23:38:12,059 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-15 23:38:12,444 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 23:38:12,800 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:38:13,608 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-15 23:38:14,892 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-15 23:38:15,221 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 23:38:15,831 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-15 23:38:16,228 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-15 23:38:16,565 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-15 23:38:16,909 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-15 23:38:17,603 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-15 23:38:17,992 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-15 23:38:18,303 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:38:18,585 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-15 23:38:19,240 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-11-15 23:38:19,519 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-15 23:38:19,695 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-15 23:38:19,941 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-11-15 23:38:20,225 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-15 23:38:20,414 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-15 23:38:21,245 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:38:21,472 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-15 23:38:21,785 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-15 23:38:21,955 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 23:38:22,967 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-15 23:38:23,165 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-15 23:38:23,522 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-15 23:38:23,872 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-11-15 23:38:24,169 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:38:24,442 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 23:38:24,687 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 23:38:24,901 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:38:25,172 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-15 23:38:25,627 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-11-15 23:38:25,782 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 23:38:26,080 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-15 23:38:26,321 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-15 23:38:26,578 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:38:26,768 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-15 23:38:27,097 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-11-15 23:38:27,271 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-15 23:38:27,603 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-11-15 23:38:27,889 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-15 23:38:28,132 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-15 23:38:28,290 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:38:28,937 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-15 23:38:29,103 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-15 23:38:29,766 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-15 23:38:31,485 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 23:38:31,726 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-15 23:38:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:38:33,484 INFO L93 Difference]: Finished difference Result 209813 states and 266157 transitions. [2019-11-15 23:38:33,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 293 states. [2019-11-15 23:38:33,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2019-11-15 23:38:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:38:33,675 INFO L225 Difference]: With dead ends: 209813 [2019-11-15 23:38:33,675 INFO L226 Difference]: Without dead ends: 194474 [2019-11-15 23:38:33,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 48 SyntacticMatches, 13 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46980 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=12763, Invalid=83647, Unknown=0, NotChecked=0, Total=96410 [2019-11-15 23:38:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194474 states. [2019-11-15 23:38:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194474 to 34972. [2019-11-15 23:38:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34972 states. [2019-11-15 23:38:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34972 states to 34972 states and 45212 transitions. [2019-11-15 23:38:37,886 INFO L78 Accepts]: Start accepts. Automaton has 34972 states and 45212 transitions. Word has length 70 [2019-11-15 23:38:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:38:37,887 INFO L462 AbstractCegarLoop]: Abstraction has 34972 states and 45212 transitions. [2019-11-15 23:38:37,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 23:38:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34972 states and 45212 transitions. [2019-11-15 23:38:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:38:37,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:38:37,893 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:38,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:38:38,096 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:38:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1898192212, now seen corresponding path program 1 times [2019-11-15 23:38:38,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:38,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449435857] [2019-11-15 23:38:38,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:38,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:38,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:38:38,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449435857] [2019-11-15 23:38:38,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245736919] [2019-11-15 23:38:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:38:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:38,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:38:38,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:38,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:38:38,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:38:38,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 23:38:38,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588559160] [2019-11-15 23:38:38,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:38:38,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:38:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:38:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:38:38,630 INFO L87 Difference]: Start difference. First operand 34972 states and 45212 transitions. Second operand 17 states. [2019-11-15 23:38:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:38:49,032 INFO L93 Difference]: Finished difference Result 112109 states and 143079 transitions. [2019-11-15 23:38:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 23:38:49,032 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-11-15 23:38:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:38:49,098 INFO L225 Difference]: With dead ends: 112109 [2019-11-15 23:38:49,099 INFO L226 Difference]: Without dead ends: 81954 [2019-11-15 23:38:49,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=592, Invalid=1664, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 23:38:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81954 states. [2019-11-15 23:38:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81954 to 44721. [2019-11-15 23:38:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2019-11-15 23:38:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 57552 transitions. [2019-11-15 23:38:53,928 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 57552 transitions. Word has length 70 [2019-11-15 23:38:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:38:53,928 INFO L462 AbstractCegarLoop]: Abstraction has 44721 states and 57552 transitions. [2019-11-15 23:38:53,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:38:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 57552 transitions. [2019-11-15 23:38:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:38:53,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:38:53,933 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:54,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:38:54,136 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:38:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -468502382, now seen corresponding path program 1 times [2019-11-15 23:38:54,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:54,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672288721] [2019-11-15 23:38:54,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:54,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:54,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:38:54,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672288721] [2019-11-15 23:38:54,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:38:54,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:38:54,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092864634] [2019-11-15 23:38:54,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:38:54,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:38:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:38:54,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:38:54,195 INFO L87 Difference]: Start difference. First operand 44721 states and 57552 transitions. Second operand 6 states. [2019-11-15 23:38:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:38:57,948 INFO L93 Difference]: Finished difference Result 76554 states and 98343 transitions. [2019-11-15 23:38:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:38:57,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 23:38:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:38:57,980 INFO L225 Difference]: With dead ends: 76554 [2019-11-15 23:38:57,980 INFO L226 Difference]: Without dead ends: 36650 [2019-11-15 23:38:58,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:38:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36650 states. [2019-11-15 23:39:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36650 to 32812. [2019-11-15 23:39:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32812 states. [2019-11-15 23:39:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32812 states to 32812 states and 41394 transitions. [2019-11-15 23:39:01,463 INFO L78 Accepts]: Start accepts. Automaton has 32812 states and 41394 transitions. Word has length 70 [2019-11-15 23:39:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:01,463 INFO L462 AbstractCegarLoop]: Abstraction has 32812 states and 41394 transitions. [2019-11-15 23:39:01,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:39:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32812 states and 41394 transitions. [2019-11-15 23:39:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:39:01,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:01,467 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:01,468 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash 617046017, now seen corresponding path program 1 times [2019-11-15 23:39:01,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:01,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812495290] [2019-11-15 23:39:01,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:01,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:01,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:01,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812495290] [2019-11-15 23:39:01,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:01,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:01,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631453592] [2019-11-15 23:39:01,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:01,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:01,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:01,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:01,508 INFO L87 Difference]: Start difference. First operand 32812 states and 41394 transitions. Second operand 3 states. [2019-11-15 23:39:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:04,964 INFO L93 Difference]: Finished difference Result 39272 states and 49426 transitions. [2019-11-15 23:39:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:04,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 23:39:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:04,989 INFO L225 Difference]: With dead ends: 39272 [2019-11-15 23:39:04,989 INFO L226 Difference]: Without dead ends: 31511 [2019-11-15 23:39:04,996 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 23:39:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31511 states. [2019-11-15 23:39:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31511 to 31509. [2019-11-15 23:39:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31509 states. [2019-11-15 23:39:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31509 states to 31509 states and 39151 transitions. [2019-11-15 23:39:08,333 INFO L78 Accepts]: Start accepts. Automaton has 31509 states and 39151 transitions. Word has length 71 [2019-11-15 23:39:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:08,333 INFO L462 AbstractCegarLoop]: Abstraction has 31509 states and 39151 transitions. [2019-11-15 23:39:08,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 31509 states and 39151 transitions. [2019-11-15 23:39:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:39:08,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:08,338 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:08,338 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1402634332, now seen corresponding path program 1 times [2019-11-15 23:39:08,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:08,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043067427] [2019-11-15 23:39:08,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:08,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:08,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:08,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043067427] [2019-11-15 23:39:08,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197215809] [2019-11-15 23:39:08,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:39:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:08,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 23:39:08,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:39:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:10,365 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:39:10,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-11-15 23:39:10,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539632216] [2019-11-15 23:39:10,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 23:39:10,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 23:39:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1613, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 23:39:10,366 INFO L87 Difference]: Start difference. First operand 31509 states and 39151 transitions. Second operand 43 states. [2019-11-15 23:39:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:21,360 INFO L93 Difference]: Finished difference Result 96759 states and 119901 transitions. [2019-11-15 23:39:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 23:39:21,361 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 72 [2019-11-15 23:39:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:21,419 INFO L225 Difference]: With dead ends: 96759 [2019-11-15 23:39:21,419 INFO L226 Difference]: Without dead ends: 69417 [2019-11-15 23:39:21,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=809, Invalid=4303, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 23:39:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69417 states. [2019-11-15 23:39:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69417 to 41522. [2019-11-15 23:39:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41522 states. [2019-11-15 23:39:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41522 states to 41522 states and 51214 transitions. [2019-11-15 23:39:26,001 INFO L78 Accepts]: Start accepts. Automaton has 41522 states and 51214 transitions. Word has length 72 [2019-11-15 23:39:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:26,002 INFO L462 AbstractCegarLoop]: Abstraction has 41522 states and 51214 transitions. [2019-11-15 23:39:26,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 23:39:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 41522 states and 51214 transitions. [2019-11-15 23:39:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:39:26,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:26,006 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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 23:39:26,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:39:26,206 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash -340931127, now seen corresponding path program 1 times [2019-11-15 23:39:26,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:26,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001215744] [2019-11-15 23:39:26,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:26,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:26,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:26,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001215744] [2019-11-15 23:39:26,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:26,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:26,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225494792] [2019-11-15 23:39:26,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:39:26,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:26,241 INFO L87 Difference]: Start difference. First operand 41522 states and 51214 transitions. Second operand 3 states. [2019-11-15 23:39:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:30,202 INFO L93 Difference]: Finished difference Result 77860 states and 95719 transitions. [2019-11-15 23:39:30,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:39:30,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-15 23:39:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:30,234 INFO L225 Difference]: With dead ends: 77860 [2019-11-15 23:39:30,234 INFO L226 Difference]: Without dead ends: 36399 [2019-11-15 23:39:30,252 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 23:39:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36399 states. [2019-11-15 23:39:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36399 to 36346. [2019-11-15 23:39:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36346 states. [2019-11-15 23:39:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36346 states to 36346 states and 43615 transitions. [2019-11-15 23:39:34,293 INFO L78 Accepts]: Start accepts. Automaton has 36346 states and 43615 transitions. Word has length 72 [2019-11-15 23:39:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:34,293 INFO L462 AbstractCegarLoop]: Abstraction has 36346 states and 43615 transitions. [2019-11-15 23:39:34,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:39:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 36346 states and 43615 transitions. [2019-11-15 23:39:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:39:34,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:34,296 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:34,296 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:34,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1154487838, now seen corresponding path program 1 times [2019-11-15 23:39:34,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:34,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79617997] [2019-11-15 23:39:34,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:34,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:34,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:39:34,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79617997] [2019-11-15 23:39:34,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:34,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:39:34,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948052730] [2019-11-15 23:39:34,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:39:34,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:34,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:39:34,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:39:34,354 INFO L87 Difference]: Start difference. First operand 36346 states and 43615 transitions. Second operand 6 states. [2019-11-15 23:39:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:38,881 INFO L93 Difference]: Finished difference Result 71449 states and 85856 transitions. [2019-11-15 23:39:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:39:38,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-15 23:39:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:38,912 INFO L225 Difference]: With dead ends: 71449 [2019-11-15 23:39:38,912 INFO L226 Difference]: Without dead ends: 37444 [2019-11-15 23:39:38,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:39:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37444 states. [2019-11-15 23:39:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37444 to 35144. [2019-11-15 23:39:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35144 states. [2019-11-15 23:39:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35144 states to 35144 states and 41882 transitions. [2019-11-15 23:39:43,071 INFO L78 Accepts]: Start accepts. Automaton has 35144 states and 41882 transitions. Word has length 72 [2019-11-15 23:39:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:43,072 INFO L462 AbstractCegarLoop]: Abstraction has 35144 states and 41882 transitions. [2019-11-15 23:39:43,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:39:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35144 states and 41882 transitions. [2019-11-15 23:39:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:39:43,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:43,074 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:43,074 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -988332999, now seen corresponding path program 1 times [2019-11-15 23:39:43,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:43,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312648619] [2019-11-15 23:39:43,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:43,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:43,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:43,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312648619] [2019-11-15 23:39:43,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943519696] [2019-11-15 23:39:43,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:39:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:43,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 23:39:43,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:39:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:44,673 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:39:44,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 37 [2019-11-15 23:39:44,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583867918] [2019-11-15 23:39:44,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 23:39:44,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 23:39:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 23:39:44,675 INFO L87 Difference]: Start difference. First operand 35144 states and 41882 transitions. Second operand 37 states. [2019-11-15 23:39:44,894 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-15 23:39:48,031 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-15 23:40:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:03,877 INFO L93 Difference]: Finished difference Result 74506 states and 88264 transitions. [2019-11-15 23:40:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-11-15 23:40:03,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2019-11-15 23:40:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:03,939 INFO L225 Difference]: With dead ends: 74506 [2019-11-15 23:40:03,939 INFO L226 Difference]: Without dead ends: 66042 [2019-11-15 23:40:03,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2104, Invalid=13646, Unknown=0, NotChecked=0, Total=15750 [2019-11-15 23:40:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66042 states. [2019-11-15 23:40:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66042 to 38538. [2019-11-15 23:40:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38538 states. [2019-11-15 23:40:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38538 states to 38538 states and 46019 transitions. [2019-11-15 23:40:08,818 INFO L78 Accepts]: Start accepts. Automaton has 38538 states and 46019 transitions. Word has length 73 [2019-11-15 23:40:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:08,819 INFO L462 AbstractCegarLoop]: Abstraction has 38538 states and 46019 transitions. [2019-11-15 23:40:08,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 23:40:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 38538 states and 46019 transitions. [2019-11-15 23:40:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:40:08,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:08,827 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 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 23:40:09,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:09,028 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1817157587, now seen corresponding path program 1 times [2019-11-15 23:40:09,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:09,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902513648] [2019-11-15 23:40:09,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:09,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:40:09,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902513648] [2019-11-15 23:40:09,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575910541] [2019-11-15 23:40:09,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:40:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:09,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:40:09,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:09,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 23:40:09,775 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:09,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-11-15 23:40:09,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265884779] [2019-11-15 23:40:09,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 23:40:09,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:09,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 23:40:09,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:40:09,776 INFO L87 Difference]: Start difference. First operand 38538 states and 46019 transitions. Second operand 21 states. [2019-11-15 23:40:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:20,005 INFO L93 Difference]: Finished difference Result 86323 states and 102647 transitions. [2019-11-15 23:40:20,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 23:40:20,005 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2019-11-15 23:40:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:20,073 INFO L225 Difference]: With dead ends: 86323 [2019-11-15 23:40:20,073 INFO L226 Difference]: Without dead ends: 71452 [2019-11-15 23:40:20,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=396, Invalid=1164, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 23:40:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71452 states. [2019-11-15 23:40:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71452 to 54453. [2019-11-15 23:40:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54453 states. [2019-11-15 23:40:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54453 states to 54453 states and 64852 transitions. [2019-11-15 23:40:27,216 INFO L78 Accepts]: Start accepts. Automaton has 54453 states and 64852 transitions. Word has length 104 [2019-11-15 23:40:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:27,216 INFO L462 AbstractCegarLoop]: Abstraction has 54453 states and 64852 transitions. [2019-11-15 23:40:27,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 23:40:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 54453 states and 64852 transitions. [2019-11-15 23:40:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 23:40:27,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:27,227 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:27,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:27,427 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash -41072578, now seen corresponding path program 2 times [2019-11-15 23:40:27,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:27,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604769968] [2019-11-15 23:40:27,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 23:40:27,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604769968] [2019-11-15 23:40:27,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:27,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:27,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567124903] [2019-11-15 23:40:27,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:27,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:27,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:27,483 INFO L87 Difference]: Start difference. First operand 54453 states and 64852 transitions. Second operand 3 states. [2019-11-15 23:40:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:31,004 INFO L93 Difference]: Finished difference Result 80712 states and 96381 transitions. [2019-11-15 23:40:31,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:31,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 23:40:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:31,027 INFO L225 Difference]: With dead ends: 80712 [2019-11-15 23:40:31,027 INFO L226 Difference]: Without dead ends: 26311 [2019-11-15 23:40:31,040 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 23:40:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2019-11-15 23:40:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 24101. [2019-11-15 23:40:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24101 states. [2019-11-15 23:40:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24101 states to 24101 states and 28395 transitions. [2019-11-15 23:40:33,946 INFO L78 Accepts]: Start accepts. Automaton has 24101 states and 28395 transitions. Word has length 105 [2019-11-15 23:40:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:33,946 INFO L462 AbstractCegarLoop]: Abstraction has 24101 states and 28395 transitions. [2019-11-15 23:40:33,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 24101 states and 28395 transitions. [2019-11-15 23:40:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 23:40:33,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:33,951 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 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 23:40:33,951 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2112863779, now seen corresponding path program 1 times [2019-11-15 23:40:33,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:33,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387756544] [2019-11-15 23:40:33,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:33,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:33,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:40:34,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387756544] [2019-11-15 23:40:34,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086516877] [2019-11-15 23:40:34,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:40:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:34,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:40:34,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:34,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 52 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:40:34,799 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:34,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2019-11-15 23:40:34,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264126885] [2019-11-15 23:40:34,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:40:34,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:40:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:40:34,800 INFO L87 Difference]: Start difference. First operand 24101 states and 28395 transitions. Second operand 14 states. [2019-11-15 23:40:35,836 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 23:40:35,975 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-15 23:40:36,684 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-15 23:40:36,840 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-15 23:40:37,049 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-15 23:40:37,265 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 23:40:37,422 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-15 23:40:37,561 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-15 23:40:37,893 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-15 23:40:38,033 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-15 23:40:38,519 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 23:40:38,658 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-15 23:40:38,983 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 23:40:39,369 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 23:40:39,908 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-15 23:40:40,812 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-15 23:40:41,064 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-15 23:40:41,273 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-15 23:40:42,745 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 23:40:44,149 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 23:40:44,410 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 23:40:45,093 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-15 23:40:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:48,194 INFO L93 Difference]: Finished difference Result 65778 states and 77798 transitions. [2019-11-15 23:40:48,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-11-15 23:40:48,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 106 [2019-11-15 23:40:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:48,233 INFO L225 Difference]: With dead ends: 65778 [2019-11-15 23:40:48,233 INFO L226 Difference]: Without dead ends: 47608 [2019-11-15 23:40:48,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1112, Invalid=5208, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 23:40:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47608 states. [2019-11-15 23:40:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47608 to 40342. [2019-11-15 23:40:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40342 states. [2019-11-15 23:40:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40342 states to 40342 states and 46976 transitions. [2019-11-15 23:40:53,456 INFO L78 Accepts]: Start accepts. Automaton has 40342 states and 46976 transitions. Word has length 106 [2019-11-15 23:40:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:53,456 INFO L462 AbstractCegarLoop]: Abstraction has 40342 states and 46976 transitions. [2019-11-15 23:40:53,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:40:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 40342 states and 46976 transitions. [2019-11-15 23:40:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 23:40:53,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:53,463 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 23:40:53,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:53,665 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1674846445, now seen corresponding path program 1 times [2019-11-15 23:40:53,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:53,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94459938] [2019-11-15 23:40:53,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:53,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:53,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:40:53,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94459938] [2019-11-15 23:40:53,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395890908] [2019-11-15 23:40:53,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:40:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:54,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:40:54,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:54,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:54,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:54,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:54,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:40:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:40:54,559 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:54,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-11-15 23:40:54,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568754065] [2019-11-15 23:40:54,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:40:54,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:40:54,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:40:54,561 INFO L87 Difference]: Start difference. First operand 40342 states and 46976 transitions. Second operand 22 states. [2019-11-15 23:41:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:11,277 INFO L93 Difference]: Finished difference Result 81906 states and 95358 transitions. [2019-11-15 23:41:11,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-11-15 23:41:11,277 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 117 [2019-11-15 23:41:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:11,330 INFO L225 Difference]: With dead ends: 81906 [2019-11-15 23:41:11,331 INFO L226 Difference]: Without dead ends: 61596 [2019-11-15 23:41:11,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1814, Invalid=8286, Unknown=0, NotChecked=0, Total=10100 [2019-11-15 23:41:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61596 states. [2019-11-15 23:41:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61596 to 35453. [2019-11-15 23:41:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35453 states. [2019-11-15 23:41:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35453 states to 35453 states and 40862 transitions. [2019-11-15 23:41:16,740 INFO L78 Accepts]: Start accepts. Automaton has 35453 states and 40862 transitions. Word has length 117 [2019-11-15 23:41:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:16,740 INFO L462 AbstractCegarLoop]: Abstraction has 35453 states and 40862 transitions. [2019-11-15 23:41:16,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:41:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35453 states and 40862 transitions. [2019-11-15 23:41:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 23:41:16,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:16,745 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:16,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:16,945 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1442700781, now seen corresponding path program 1 times [2019-11-15 23:41:16,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:16,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757869283] [2019-11-15 23:41:16,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:16,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:16,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:41:16,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757869283] [2019-11-15 23:41:16,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:16,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:41:16,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950410266] [2019-11-15 23:41:16,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:41:16,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:41:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:41:16,995 INFO L87 Difference]: Start difference. First operand 35453 states and 40862 transitions. Second operand 3 states. [2019-11-15 23:41:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:18,939 INFO L93 Difference]: Finished difference Result 47092 states and 54301 transitions. [2019-11-15 23:41:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:41:18,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-15 23:41:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:18,949 INFO L225 Difference]: With dead ends: 47092 [2019-11-15 23:41:18,949 INFO L226 Difference]: Without dead ends: 11707 [2019-11-15 23:41:18,962 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 23:41:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11707 states. [2019-11-15 23:41:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11707 to 11045. [2019-11-15 23:41:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2019-11-15 23:41:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 12564 transitions. [2019-11-15 23:41:20,540 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 12564 transitions. Word has length 118 [2019-11-15 23:41:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:20,540 INFO L462 AbstractCegarLoop]: Abstraction has 11045 states and 12564 transitions. [2019-11-15 23:41:20,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:41:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 12564 transitions. [2019-11-15 23:41:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 23:41:20,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:20,542 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 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 23:41:20,542 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1989910784, now seen corresponding path program 1 times [2019-11-15 23:41:20,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:20,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104081748] [2019-11-15 23:41:20,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:20,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:20,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 52 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:41:20,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104081748] [2019-11-15 23:41:20,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498238192] [2019-11-15 23:41:20,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:41:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:21,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:41:21,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:21,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:41:21,640 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:21,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-15 23:41:21,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990436734] [2019-11-15 23:41:21,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 23:41:21,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:21,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 23:41:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:41:21,642 INFO L87 Difference]: Start difference. First operand 11045 states and 12564 transitions. Second operand 24 states. [2019-11-15 23:41:22,377 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-15 23:41:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:26,024 INFO L93 Difference]: Finished difference Result 21890 states and 25015 transitions. [2019-11-15 23:41:26,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:41:26,024 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 118 [2019-11-15 23:41:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:26,038 INFO L225 Difference]: With dead ends: 21890 [2019-11-15 23:41:26,038 INFO L226 Difference]: Without dead ends: 18176 [2019-11-15 23:41:26,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 23:41:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18176 states. [2019-11-15 23:41:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18176 to 13360. [2019-11-15 23:41:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13360 states. [2019-11-15 23:41:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13360 states to 13360 states and 15164 transitions. [2019-11-15 23:41:28,146 INFO L78 Accepts]: Start accepts. Automaton has 13360 states and 15164 transitions. Word has length 118 [2019-11-15 23:41:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:28,146 INFO L462 AbstractCegarLoop]: Abstraction has 13360 states and 15164 transitions. [2019-11-15 23:41:28,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 23:41:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 13360 states and 15164 transitions. [2019-11-15 23:41:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 23:41:28,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:28,148 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 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, 1] [2019-11-15 23:41:28,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:28,348 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1120663307, now seen corresponding path program 2 times [2019-11-15 23:41:28,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:28,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914425516] [2019-11-15 23:41:28,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:28,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:41:29,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914425516] [2019-11-15 23:41:29,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706865260] [2019-11-15 23:41:29,399 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:41:29,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:41:29,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:41:29,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 23:41:29,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 23:41:29,977 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:29,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-11-15 23:41:29,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750242939] [2019-11-15 23:41:29,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 23:41:29,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 23:41:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:41:29,979 INFO L87 Difference]: Start difference. First operand 13360 states and 15164 transitions. Second operand 29 states. [2019-11-15 23:41:32,051 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 23:41:34,077 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-15 23:41:34,342 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-11-15 23:41:34,535 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-15 23:41:34,709 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-15 23:41:34,851 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 23:41:35,394 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-15 23:41:35,728 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-15 23:41:36,440 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-11-15 23:41:36,660 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-15 23:41:36,880 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-15 23:41:37,054 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-11-15 23:41:37,233 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-15 23:41:37,461 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-11-15 23:41:37,671 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-15 23:41:37,883 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-11-15 23:41:38,044 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:41:38,362 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-15 23:41:38,525 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-15 23:41:38,786 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-15 23:41:38,948 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-15 23:41:39,104 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-15 23:41:39,677 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 23:41:40,305 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-11-15 23:41:40,517 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-15 23:41:40,785 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-11-15 23:41:40,940 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-15 23:41:41,335 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-15 23:41:41,484 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-15 23:41:41,861 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-11-15 23:41:42,137 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:41:42,303 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-15 23:41:42,500 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-15 23:41:42,925 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-15 23:41:43,101 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-15 23:41:43,546 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-15 23:41:43,844 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-15 23:41:44,211 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-15 23:41:44,782 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:41:45,166 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-11-15 23:41:45,595 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-15 23:41:45,874 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-15 23:41:46,292 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-11-15 23:41:47,458 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-15 23:41:47,876 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-15 23:41:48,234 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-15 23:41:48,643 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-15 23:41:48,794 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-15 23:41:48,986 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-15 23:41:49,393 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-11-15 23:41:49,589 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-11-15 23:41:49,926 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-11-15 23:41:50,070 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-15 23:41:50,259 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-11-15 23:41:50,470 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-15 23:41:50,629 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-15 23:41:51,206 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-11-15 23:41:51,518 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-11-15 23:41:51,718 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-15 23:41:51,982 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-15 23:41:52,224 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-15 23:41:52,542 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-15 23:41:53,009 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:41:53,215 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-15 23:41:53,415 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:41:53,795 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-11-15 23:41:55,076 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-11-15 23:41:55,369 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-15 23:41:55,639 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-11-15 23:41:55,890 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-11-15 23:41:56,874 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-11-15 23:41:57,129 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-15 23:41:58,782 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-15 23:41:59,486 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-15 23:41:59,693 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-15 23:41:59,886 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-15 23:42:00,267 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-11-15 23:42:00,469 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-15 23:42:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:01,379 INFO L93 Difference]: Finished difference Result 33924 states and 38472 transitions. [2019-11-15 23:42:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-11-15 23:42:01,379 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2019-11-15 23:42:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:01,400 INFO L225 Difference]: With dead ends: 33924 [2019-11-15 23:42:01,401 INFO L226 Difference]: Without dead ends: 29428 [2019-11-15 23:42:01,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20819 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=5784, Invalid=47808, Unknown=0, NotChecked=0, Total=53592 [2019-11-15 23:42:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29428 states. [2019-11-15 23:42:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29428 to 15032. [2019-11-15 23:42:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15032 states. [2019-11-15 23:42:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15032 states to 15032 states and 17076 transitions. [2019-11-15 23:42:03,979 INFO L78 Accepts]: Start accepts. Automaton has 15032 states and 17076 transitions. Word has length 119 [2019-11-15 23:42:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:03,979 INFO L462 AbstractCegarLoop]: Abstraction has 15032 states and 17076 transitions. [2019-11-15 23:42:03,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 23:42:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15032 states and 17076 transitions. [2019-11-15 23:42:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:42:03,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:03,981 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:04,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:42:04,182 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash -597801272, now seen corresponding path program 1 times [2019-11-15 23:42:04,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:04,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906576264] [2019-11-15 23:42:04,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:04,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:04,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:04,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906576264] [2019-11-15 23:42:04,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133983782] [2019-11-15 23:42:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:42:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:04,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 23:42:04,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:05,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:05,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:05,968 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:42:05,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2019-11-15 23:42:05,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438907145] [2019-11-15 23:42:05,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 23:42:05,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 23:42:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 23:42:05,969 INFO L87 Difference]: Start difference. First operand 15032 states and 17076 transitions. Second operand 38 states. [2019-11-15 23:42:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:14,020 INFO L93 Difference]: Finished difference Result 25432 states and 28885 transitions. [2019-11-15 23:42:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-15 23:42:14,020 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 123 [2019-11-15 23:42:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:14,035 INFO L225 Difference]: With dead ends: 25432 [2019-11-15 23:42:14,035 INFO L226 Difference]: Without dead ends: 21629 [2019-11-15 23:42:14,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=733, Invalid=5747, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 23:42:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21629 states. [2019-11-15 23:42:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21629 to 18548. [2019-11-15 23:42:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18548 states. [2019-11-15 23:42:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18548 states to 18548 states and 21057 transitions. [2019-11-15 23:42:16,988 INFO L78 Accepts]: Start accepts. Automaton has 18548 states and 21057 transitions. Word has length 123 [2019-11-15 23:42:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:16,989 INFO L462 AbstractCegarLoop]: Abstraction has 18548 states and 21057 transitions. [2019-11-15 23:42:16,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 23:42:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18548 states and 21057 transitions. [2019-11-15 23:42:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:42:16,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:16,991 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:17,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:42:17,194 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -714291388, now seen corresponding path program 1 times [2019-11-15 23:42:17,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:17,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869147290] [2019-11-15 23:42:17,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:17,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:17,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:17,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869147290] [2019-11-15 23:42:17,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629391562] [2019-11-15 23:42:17,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:42:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:18,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 23:42:18,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:18,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:18,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:19,298 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:42:19,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2019-11-15 23:42:19,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591551315] [2019-11-15 23:42:19,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 23:42:19,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 23:42:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1520, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 23:42:19,299 INFO L87 Difference]: Start difference. First operand 18548 states and 21057 transitions. Second operand 41 states. [2019-11-15 23:42:20,385 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-11-15 23:42:20,603 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-15 23:42:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:44,137 INFO L93 Difference]: Finished difference Result 23572 states and 26750 transitions. [2019-11-15 23:42:44,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 23:42:44,138 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 123 [2019-11-15 23:42:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:44,152 INFO L225 Difference]: With dead ends: 23572 [2019-11-15 23:42:44,152 INFO L226 Difference]: Without dead ends: 18844 [2019-11-15 23:42:44,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=593, Invalid=7062, Unknown=1, NotChecked=0, Total=7656 [2019-11-15 23:42:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18844 states. [2019-11-15 23:42:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18844 to 17780. [2019-11-15 23:42:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17780 states. [2019-11-15 23:42:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17780 states to 17780 states and 20179 transitions. [2019-11-15 23:42:47,127 INFO L78 Accepts]: Start accepts. Automaton has 17780 states and 20179 transitions. Word has length 123 [2019-11-15 23:42:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:47,128 INFO L462 AbstractCegarLoop]: Abstraction has 17780 states and 20179 transitions. [2019-11-15 23:42:47,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 23:42:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17780 states and 20179 transitions. [2019-11-15 23:42:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:42:47,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:47,129 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:47,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:42:47,330 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1776651436, now seen corresponding path program 1 times [2019-11-15 23:42:47,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:47,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082504512] [2019-11-15 23:42:47,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:47,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:47,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:48,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082504512] [2019-11-15 23:42:48,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87767229] [2019-11-15 23:42:48,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/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 23:42:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:48,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:42:48,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:48,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:49,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:42:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:49,510 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:42:49,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-11-15 23:42:49,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078230925] [2019-11-15 23:42:49,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 23:42:49,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 23:42:49,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 23:42:49,511 INFO L87 Difference]: Start difference. First operand 17780 states and 20179 transitions. Second operand 36 states. [2019-11-15 23:42:49,743 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-11-15 23:42:52,991 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 23:42:53,608 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-15 23:43:08,352 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 23:43:11,748 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:44:55,750 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 23:44:57,947 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 23:45:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:43,959 INFO L93 Difference]: Finished difference Result 28989 states and 32777 transitions. [2019-11-15 23:45:43,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-11-15 23:45:43,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 123 [2019-11-15 23:45:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:43,978 INFO L225 Difference]: With dead ends: 28989 [2019-11-15 23:45:43,978 INFO L226 Difference]: Without dead ends: 23775 [2019-11-15 23:45:43,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3799 ImplicationChecksByTransitivity, 86.2s TimeCoverageRelationStatistics Valid=1168, Invalid=12139, Unknown=33, NotChecked=0, Total=13340 [2019-11-15 23:45:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23775 states. [2019-11-15 23:45:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23775 to 19684. [2019-11-15 23:45:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19684 states. [2019-11-15 23:45:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19684 states to 19684 states and 22299 transitions. [2019-11-15 23:45:47,383 INFO L78 Accepts]: Start accepts. Automaton has 19684 states and 22299 transitions. Word has length 123 [2019-11-15 23:45:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:47,384 INFO L462 AbstractCegarLoop]: Abstraction has 19684 states and 22299 transitions. [2019-11-15 23:45:47,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 23:45:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19684 states and 22299 transitions. [2019-11-15 23:45:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 23:45:47,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:47,387 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:47,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:47,588 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2044509292, now seen corresponding path program 1 times [2019-11-15 23:45:47,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:47,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171717125] [2019-11-15 23:45:47,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:47,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:47,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:47,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:47,721 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:45:47,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:45:47 BoogieIcfgContainer [2019-11-15 23:45:47,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:45:47,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:45:47,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:45:47,894 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:45:47,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:56" (3/4) ... [2019-11-15 23:45:47,897 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:45:48,034 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e81440e-8e94-4075-ac34-415dc3b7101f/bin/uautomizer/witness.graphml [2019-11-15 23:45:48,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:45:48,035 INFO L168 Benchmark]: Toolchain (without parser) took 533123.95 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -557.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:45:48,036 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:48,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:48,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:48,037 INFO L168 Benchmark]: Boogie Preprocessor took 33.53 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 23:45:48,037 INFO L168 Benchmark]: RCFGBuilder took 547.82 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:48,037 INFO L168 Benchmark]: TraceAbstraction took 531886.30 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -429.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:45:48,038 INFO L168 Benchmark]: Witness Printer took 140.61 ms. Allocated memory is still 4.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:48,039 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.53 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 547.82 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 531886.30 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -429.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 140.61 ms. Allocated memory is still 4.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 352]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] char r1 ; [L72] port_t p1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L77] msg_t send1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L80] port_t p2 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L85] msg_t send2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L88] port_t p3 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L93] msg_t send3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L196] void (*nodes[3])(void) = { & node1, & node2, & node3}; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L296] int c1 ; [L297] int i2 ; [L300] c1 = 0 [L301] r1 = __VERIFIER_nondet_char() [L302] id1 = __VERIFIER_nondet_char() [L303] st1 = __VERIFIER_nondet_char() [L304] send1 = __VERIFIER_nondet_char() [L305] mode1 = __VERIFIER_nondet_bool() [L306] alive1 = __VERIFIER_nondet_bool() [L307] id2 = __VERIFIER_nondet_char() [L308] st2 = __VERIFIER_nondet_char() [L309] send2 = __VERIFIER_nondet_char() [L310] mode2 = __VERIFIER_nondet_bool() [L311] alive2 = __VERIFIER_nondet_bool() [L312] id3 = __VERIFIER_nondet_char() [L313] st3 = __VERIFIER_nondet_char() [L314] send3 = __VERIFIER_nondet_char() [L315] mode3 = __VERIFIER_nondet_bool() [L316] alive3 = __VERIFIER_nondet_bool() [L199] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L202] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L203] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L206] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L207] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L209] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L211] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L213] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L215] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L216] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L217] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE (int )id2 != (int )id3 [L219] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L271] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L317] i2 = init() [L319] p1_old = nomsg [L320] p1_new = nomsg [L321] p2_old = nomsg [L322] p2_new = nomsg [L323] p3_old = nomsg [L324] p3_new = nomsg [L325] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L283] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L286] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 1 error locations. Result: UNSAFE, OverallTime: 531.8s, OverallIterations: 39, TraceHistogramMax: 6, AutomataDifference: 431.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6505 SDtfs, 35870 SDslu, 61481 SDs, 0 SdLazy, 27891 SolverSat, 1918 SolverUnsat, 44 SolverUnknown, 0 SolverNotchecked, 122.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2835 GetRequests, 1332 SyntacticMatches, 35 SemanticMatches, 1468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87312 ImplicationChecksByTransitivity, 204.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54453occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 76.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 376647 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 4438 NumberOfCodeBlocks, 4438 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 4236 ConstructedInterpolants, 326 QuantifiedInterpolants, 5032398 SizeOfPredicates, 83 NumberOfNonLiveVariables, 5895 ConjunctsInSsa, 365 ConjunctsInUnsatCore, 54 InterpolantComputations, 22 PerfectInterpolantSequences, 1137/2016 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...